Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis

Authors:
Affiliations:
Venue:
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Year:
1995

Citing 7
Cited 2

Proving liveness for networks of communicating finite state machines

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
On deadlock detection in systems of communicating finite state machines

Computers and Artificial Intelligence
An improved protocol reachability analysis technique

Software—Practice & Experience
Data flow analysis of communicating finite state machines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of a class of communicating finite state machines

Acta Informatica
On Communicating Finite-State Machines

Journal of the ACM (JACM)
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

Automated Online Monitoring of Distributed Applications through External Monitors

IEEE Transactions on Dependable and Secure Computing
A modular methodology to verify communication protocols

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair reachability is a very useful technique in detecting errors of deadlocks and unspecified receptions in networks of communicating finite state machines (CFSMs) consisting of two machines. The paper extends the classical fair reachability technique, which is only applicable to the class of two-machine CFSMs, to the general class of CFSMs. For bounded CFSMs, the extended fair reachability technique reduces by more than one half the total number of reachable global states that have to be searched in verifying freedom from deadlocks. The usefulness of the new reachability technique, called even reachability, is demonstrated through two examples.