Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions

In this paper, we extend the generalized fair reachability notion to cyclic protocols with nondeterministic and internal transitions. By properly incorporating internal transitions into the formulation of fair progress vectors, we prove that with only a few modifications, all the results established for cyclic protocols without nondeterministic and internal transitions still hold even if nondeterministic and internal transitions are allowed. We identify indefiniteness as a new type of logical error resulting from reachable internal execution cycles and show that it can also be detected for the class of cyclic protocols with finite fair reachable state spaces with finite extension.

[1]  Omar Rafiq,et al.  Decidability issues in reduced reachability analysis , 1993, 1993 International Conference on Network Protocols.

[2]  Raymond E. Miller,et al.  Reachability problems for cyclic protocols , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

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

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

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

[6]  Omar Rafiq,et al.  On improving reduced reachability analysis , 1992, FORTE.

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

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

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

[10]  Deepinder P. Sidhu,et al.  Experience with formal methods in protocol development , 1991, CCRV.

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

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

[13]  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.