On application of weaker simulations to parameterized model checking by network invariants technique

In this paper we consider parameterized model checking problem of asynchronous communicating processes in the framework of network invariants. The framework of network invariants relies on relations over labelled transition systems such as simulation, bisimulation, trace equivalence and trace inclusion. In the case of asynchronous parallel composition simulation and bisimulation appear to be rather strong and thus require additional abstractions.In our work three weaker simulation relations are proposed namely quasi-block simulation, block simulation and semi-block simulation. Quasi-block simulation has all the properties to be applied to the technique of network invariants. Block simulation is a stronger relation than a quasi-block simulation. It is used to find an invariant. An initial semi-block simulation over two models exists if and only if an initial block simulation over that models exists. Thus, it is sufficient to compute a semi-block simulation on the models. The sketch of an algorithm to perform such a computation is presented. Previously, we used the framework to check a parameterized model of RSVP protocol. In this paper a series of optimizations that decrease the time of computation are shown.

[1]  Somesh Jha,et al.  Veryfying Parameterized Networks using Abstraction and Regular Languages , 1995, CONCUR.

[2]  Vladimir A. Zakharov,et al.  An Approach to the Verification of Symmetric Parameterized Distributed Systems , 2005, Programming and Computer Software.

[3]  Rob Gerthy Partial Order Reductions Preserving Simulations , 1999 .

[4]  Gerard J. Holzmann,et al.  A minimized automaton representation of reachable states , 1999, International Journal on Software Tools for Technology Transfer.

[5]  Vladimir A. Zakharov,et al.  An invariant-based approach to the verification of asynchronous parameterized networks , 2010, J. Symb. Comput..

[6]  Wojciech Penczek,et al.  Improving Partial Order Reductions for Universal Branching Time Properties , 2000, Fundam. Informaticae.

[7]  Helmut Veith,et al.  Verification by Network Decomposition , 2004, CONCUR.

[8]  Amir Pnueli,et al.  Verification by Augmented Finitary Abstraction , 2000, Inf. Comput..

[9]  Muffy Calder,et al.  Five ways to use induction and symmetry in the verification of networks of processes by model-checking , 2002 .

[10]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[11]  Kedar S. Namjoshi,et al.  Reasoning about rings , 1995, POPL '95.

[12]  Pierre Wolper,et al.  Verifying Properties of Large Sets of Processes with Network Invariants , 1990, Automatic Verification Methods for Finite State Systems.

[13]  Parosh Aziz Abdulla,et al.  A Survey of Regular Model Checking , 2004, CONCUR.

[14]  Ramin Hojati,et al.  Structural Symmetries and Model , 1998 .

[15]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[16]  Robert P. Kurshan,et al.  A structural induction theorem for processes , 1989, PODC.

[17]  Shin Nakajima,et al.  The SPIN Model Checker : Primer and Reference Manual , 2004 .

[18]  R. Braden,et al.  Resource reSer Vation Protocol (RSVP) , 1997 .

[19]  Robert K. Brayton,et al.  Structural Symmetry and Model Checking , 1998, CAV.

[20]  Krzysztof R. Apt,et al.  Limits for Automatic Verification of Finite-State Concurrent Systems , 1986, Inf. Process. Lett..

[21]  Somesh Jha,et al.  Verifying parameterized networks , 1997, TOPL.

[22]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[23]  David Lesens,et al.  Invariants of Parameterized Binary Tree Networks as Greatest Fixpoints , 1997, AMAST.

[24]  Gerard Roca Mallofre Resource Reservation Protocol ( RSVP ) , 2022 .

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

[26]  Nicolas Halbwachs,et al.  Automatic verification of parameterized linear networks of processes , 1997, POPL '97.

[27]  David L. Dill,et al.  Verifying Systems with Replicated Components in Murϕ , 1999, Formal Methods Syst. Des..

[28]  Wojciech Penczek,et al.  A partial order approach to branching time logic model checking , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.