Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Generalized fair reachability analysis for cyclic protocols: part 1
PSTV '94 Proceedings of the fourteenth of a series of annual meetings on Protocol specification, testing and verification XIV
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Livelock Detection in Networks of Communicating Finite State Machines
Livelock Detection in Networks of Communicating Finite State Machines
Generalized fair reachability analysis for cyclic protocols
IEEE/ACM Transactions on Networking (TON)
An approach to cyclic protocol validation
Computer Communications
A modular methodology to verify communication protocols
Computer Communications
| Hi-index | 0.00 |
In this paper, we study three reachability problems for cyclic protocols: (1) global state reachability; (2) abstract state reachability; and (3) execution cycle reachability. By combining fair progress and maximal progress during state exploration, we prove that these three problems are all decidable for {\cal Q}, the class of cyclic protocols with finite fair reachable state spaces. In the course of the investigation, we also show that detection of k-indefiniteness and k-livelock are decidable for {\cal Q}.