Compositionality and locality for improving model checking in the selective mu-calculus

Model checking is an automatic technique for verifying properties of finite concurrent systems on a structure that represents the states of the system; the crucial point of the technique is to avoid the computation of all the possible states. In this paper a method of proof for concurrent systems is presented that combines several approaches to meet the previous goal. The method exploits compositionality issues, in the presence of a parallel composition of processes, to compute at most the states of each sequential process, and not their combinations; moreover the method employs abstraction techniques to compute but a subset of the states of each sequential process. Finally, tableau-based proofs are used to allow the dynamic generation of the system states when needed, taking into account the goal of the formula verification. The tableau system is proved finite, sound and complete, for finite state systems.

[1]  Rance Cleaveland,et al.  Tableau-based model checking in the propositional mu-calculus , 1990, Acta Informatica.

[2]  Colin Stirling,et al.  A Complete Compositional Model Proof System for a Subset of CCS , 1985, ICALP.

[3]  S. Berezin,et al.  A Compositional Proof System for the Modal micro-calculas and CCS , 1997 .

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

[5]  G. Winskel,et al.  A Compositional Proof System for the Modal mu-Calculus , 1994 .

[6]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[7]  Joseph Sifakis,et al.  Property Preserving Simulations , 1992, CAV.

[8]  Roope Kaivola.  Compositional Model Checking for Linear-Time Temporal Logic , 1992, CAV.

[9]  Glynn Winskel,et al.  Compositional checking of satisfaction , 1991, Formal Methods Syst. Des..

[10]  Roberto Barbuti,et al.  Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems , 1999, J. Comput. Syst. Sci..

[11]  Glynn Winskel,et al.  A compositional proof system for the modal /spl mu/-calculus , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

[13]  Stephan Merz,et al.  Model Checking , 2000 .

[14]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[15]  Roberto Barbuti,et al.  Selective µ-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems , 1997, FORTE.

[16]  Joseph Sifakis,et al.  Safety for Branching Time Semantics , 1991, ICALP.