Model Checking Based on Simultaneous Reachability Analysis

Simultaneous reachability analysis (SRA) is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. The concept of SRA is to allow a global transition in a reachability graph to contain a set of transitions of different processes such that the state reached by the global transition is independent of the execution order of the associated process transitions. In this paper, we describe how to apply the SRA approach to concurrent systems for model checking. We first describe an SRA-based framework for producing a reduced state graph that provides sufficient information for model checking. Following this framework, we present an algorithm that generates a reduced state graph for the extended finite state machine (EFSM) model with multiple ports. Empirical results indicate that, our SRA reduction algorithm performs as good as or better than the partial order reduction algorithm in SPIN.

[1]  Hasan Ural,et al.  An improvement of partial‐order verification , 1998 .

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

[3]  Michel Raynal,et al.  Distributed algorithms and protocols , 1988 .

[4]  Patrice Godefroid,et al.  Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract) , 1993, CAV.

[5]  Doron A. Peled.  Combining Partial Order Reductions with On-the-fly Model-Checking , 1994, CAV.

[6]  M.T. Liu,et al.  Global state graph reduction techniques for protocol validation in the EFSM model , 1989, Eighth Annual International Phoenix Conference on Computers and Communications. 1989 Conference Proceedings.

[7]  Hasan Ural,et al.  On improving reachability analysis for verifying progress properties of networks of CFSMs , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[8]  Mladen A. Vouk,et al.  Deadlock detection of EFSMs using simultaneous reachability analysis , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[9]  Gregory R. Andrews,et al.  Foundations of Multithreaded, Parallel, and Distributed Programming , 1999 .

[10]  Doron A. Peled,et al.  Ten Years of Partial Order Reduction , 1998, CAV.

[11]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[12]  허윤정,et al.  Holzmann의 ˝The Model Checker SPIN˝에 대하여 , 1998 .

[13]  Yuan-Chuen Lin,et al.  An Executable Protocol Test Sequence Generation Method for EFSM-specified Protocols , 1996 .

[14]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[15]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..