Generalized fair reachability analysis for cyclic protocols

In this paper, the notion of fair reachability is generalized to cyclic protocols with n/spl ges/2 machines. It is shown that each fair reachable state is of equal channel length and each deadlock state is fair reachable. As a result, deadlock detection is decidable for P, the class of cyclic protocols whose fair reachable state spaces are finite. The concept of simultaneous unboundedness is defined and the lack of it is shown to be a necessary and sufficient condition for a protocol to be in P. Through finite extension of the fair reachable state space, it is also shown that detection of unspecified receptions, unboundedness, and nonexecutable transitions are all decidable for P. Furthermore, it is shown that any protocol in P is logically correct if and only if there is no logical error in its fair reachable state space. This study demonstrates that for the class P, our generalized fair reachability analysis technique not only can achieve substantial state reduction but also maintains very competitive logical error coverage. Therefore, it is a very useful technique to prove logical correctness for a wide variety of cyclic protocols.

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

[2]  Jan K. Pachl,et al.  Protocol Description and Analysis Based on a State Transition Model with Channel Expressions , 1987, PSTV.

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

[4]  Wuxu Peng.  Single-link and time communicating finite state machines , 1994, Proceedings of ICNP - 1994 International Conference on Network Protocols.

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

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

[7]  Tat Y Choi,et al.  Protocol Analysis and Synthesis by Structured Partitions , 1986, Comput. Networks.

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

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

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

[11]  Raymond E. Miller,et al.  Deadlock detection by fair reachability analysis: from cyclic to multi-cyclic protocols (and beyond?) , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[12]  M.C. Yuang,et al.  Survey of protocol verification techniques based on finite state machine models , 1988, [1988] Proceedings. Computer Networking Symposium.

[13]  S. Purushothaman Iyer,et al.  A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines , 1990, CAV.

[14]  S. Purushothaman Iyer,et al.  Data flow analysis of communicating finite state machines , 1991, TOPL.

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

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

[17]  Ming T. Liu,et al.  Protocol verification using reachability analysis: the state space explosion problem and relief strategies , 1987, Computer Communication Review.

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

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

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