Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Mechanical verification and automatic implementation of communication protocols
IEEE Transactions on Software Engineering
On deadlock detection in systems of communicating finite state machines
Computers and Artificial Intelligence
Reduction and covering of infinite reachability trees
Information and Computation
Data flow analysis of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unreliable channels are easier to verify than perfect channels
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Effective Lossy Queue Languages
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Undecidable Problems in Unreliable Computations
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Verifying Networks of Timed Processes (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Verifying Systems with Infinite but Regular State Spaces
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Automatic Temporal Verification of Buffer Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Decidability of the termination problem for completely specified protocols
Distributed Computing
Automated validation of a communications protocol: the CCITT X.21 recommendation
IBM Journal of Research and Development
Journal of Computer and System Sciences
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Eliminating Queues from RT UML Model Representations
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Parametric Verification of a Group Membership Algorithm
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Algorithmic Verification of Invalidation-Based Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A parametric communication model for the verification of BPEL4WS compositions
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
| Hi-index | 0.00 |
In automated verification of protocols, one source of complications is that channels may have unbounded capacity, in which case a naive model of the protocol is no longer finite state. Symbolic techniques have therefore been developed for representing the contents of unbounded channels. In this paper, we survey some of these techniques and apply them to a simple leader election protocol. We consider protocols with entities modeled as finite state machines which communicate by sending messages from a finite alphabet over unbounded channels; this is a framework for which many techniques have been developed. We also consider a more general model in which messages may belong to an unbounded domain of values which may be compared according to a total ordering relation: the motivation is to study protocols with timestamps or priorities. We show how techniques from the previous setting can be extended to this more general model, but also show that reachability quickly becomes undecidable if channels preserve the ordering between messages.