Partial-Order Reduction in the Weak Modal Mu-Calculus

We present a partial-order reduction technique for local model checking of hierarchical networks of labeled transition systems in the weak modal mu-calculus. We have implemented our technique in the Concurrency Factory specification and verification environment; experimental results show that partial-order reduction can be highly effective in combating state explosion in modal mu-calculus model checking.

[1]  Rocco De Nicola,et al.  Three logics for branching bisimulation , 1995, JACM.

[2]  Chin-Laung Lei,et al.  Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract) , 1986, LICS.

[3]  Oleg Sokolsky,et al.  Efficient Graph-Based Algorithms For Model Checking In The Modal Mu-Calculus , 1996 .

[4]  Pierre Wolper,et al.  Partial-order methods for model checking: from linear time to branching time , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[5]  Antti Valmari,et al.  On-the-Fly Verification with Stubborn Sets , 1993, CAV.

[6]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[7]  Edmund M. Clarke,et al.  Formal Methods: State of the Art and Future Directions Working Group Members , 1996 .

[8]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[9]  Rance Cleaveland,et al.  The Concurrency Factory: A Development Environment for Concurrent Systems , 1996, CAV.

[10]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[11]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[12]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[13]  Rance Cleaveland,et al.  Faster Model Checking for the Modal Mu-Calculus , 1992, CAV.

[14]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[15]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

[16]  Pierre Wolper,et al.  A Partial Approach to Model Checking , 1994, Inf. Comput..

[17]  Doron A. Peled,et al.  Combining partial order reductions with on-the-fly model-checking , 1994, Formal Methods Syst. Des..

[18]  Girish Bhat,et al.  Efficient model checking via the equational /spl mu/-calculus , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[19]  Johan Lewi,et al.  Efficient Local Correctness Checking for Single and Alternating Boolean Equation Systems , 1994, ICALP.

[20]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[21]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

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

[23]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.