On improving reachability analysis for verifying progress properties of networks of CFSMs

State explosion is well-known to be the principle limitation in protocol verification. In this paper, leaping reachability analysis (LRA) is advocated as an incremental improvement of a verification technique called simultaneous reachability analysis (SRA) to tackle state explosion. SRA is a relief strategy for the verification of progress properties of protocols modeled as networks of communicating finite state machines (CFSMs) without any topological or structural constraints. The improvement is a uniform and property-driven relief strategy which proves to be adequate for detecting all deadlocks, all non-executable transitions, all unspecified receptions and all buffer overflows in a protocol specified in the CFSM model. Experiments show that LRA can largely relieve the state explosion problem by reducing the amount of storage space and execution time required for verification.

[1]  Gerard J. Holzmann,et al.  An improved protocol reachability analysis technique , 1988, Softw. Pract. Exp..

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

[3]  Mohamed G. Gouda,et al.  Closed Covers: To Verify Progress for Communicating Finite State Machines , 1984, IEEE Transactions on Software Engineering.

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

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

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

[7]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[8]  Mohamed G. Gouda,et al.  Deadlock Detection for a Class of Communicating Finite State Machine , 1982, PSTV.

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

[10]  Hasan Ural,et al.  On generalizing fair reachability analysis to protocols with arbitrary topology , 1995, PODC '95.

[11]  Hasan Ural,et al.  Verifying the safety properties of concurrent systems via simultaneous reachability , 1995 .

[12]  Hasan Ural,et al.  Protocol validation by simultaneous reachability analysis , 1997, Comput. Commun..

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

[14]  Hasan Ural,et al.  Deadlock Detection in CFSM Models via Simultaneously Executable Sets , 1994 .

[15]  Daniel Brand,et al.  Towards Analyzing and Synthesizing Protocols , 1980, IEEE Trans. Commun..

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

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

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