Reachability problems for cyclic protocols

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 an all decidable for 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 an decidable for Q.

[1]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[2]  Raymond E. Miller,et al.  Generalized fair reachability analysis for cyclic protocols , 1996, TNET.

[3]  Raymond E. Miller,et al.  Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions , 1995, Proceedings of International Conference on Network Protocols.

[4]  Raymond E. Miller,et al.  Generalized fair reachability analysis for cyclic protocols: part 1 , 1994, PSTV.

[5]  Mohamed G. Gouda,et al.  On the Decidability of Livelock Detection in Networks of Communicating Finite State Machines , 1984, PSTV.

[6]  Raymond E. Miller,et al.  Generalized fair reachability analysis for cyclic protocols: decidability for logical correctness problems , 1994, Proceedings of ICNP - 1994 International Conference on Network Protocols.

[7]  Mohamed G. Gouda,et al.  Livelock Detection in Networks of Communicating Finite State Machines , 1984 .

[8]  Hong Liu,et al.  Deadlock detection for cyclic protocols using generalized fair reachability analysis , 1993 .

[9]  Mohamed G. Gouda,et al.  Proving liveness for networks of communicating finite state machines , 1986, TOPL.

[10]  Mohamed G. Gouda,et al.  Protocol Validation by Fair Progress State Exploration , 1985, Comput. Networks.

[11]  Mohamed G. Gouda,et al.  Protocol Validation by Maximal Progress State Exploration , 1984, IEEE Trans. Commun..

[12]  Colin H. West,et al.  An Improved Protocol Validation Technique , 1982, Comput. Networks.