Paper Info
Title
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)
Abstract
We study the verification of properties of communication protocols modeled by a finite set of finite-state machines that communicate by exchanging messages via unbounded FIFO queues. It is well-known that most interesting verification problems, such as deadlock detection, are undecidable for this class of systems. However, in practice, these verification problems may very well turn out to be decidable for a subclass containing most “real” protocols.
Year
DOI
Venue
1996
10.1007/3-540-61474-5_53
CAV
Keywords
Field
DocType
infinite state,symbolic verification,extended abstract,communication protocols,communication protocol,deadlock detection,state space,finite state machine
Finite set,Disjoint sets,Computer science,Tuple,Theoretical computer science,Decidability,Turing machine,State space,Recursion,Bounded function
Conference
Volume
ISBN
Citations 
1102
3-540-61474-5
46
PageRank 
References 
Authors
2.57
15
2
Name
Order
Citations
PageRank
Bernard Boigelot170748.59
Patrice Godefroid23622275.78