Skip to main content
SpringerLink
Log in

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

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdulla, P., Jonsson, B., Nilsson, M., and Saksena, M., A Survey of Regular Model Checking, Proc. 15th Int. Conf. on Concurrency Theory, Lecture Notes in Computer Science, 2004, pp. 35–48.

  2. Apt, K.R. and Kozen, D., Limits for Automatic Program Verification of Finite-State Concurrent Systems, Information Processing Letters, 1986, vol. 22, no. 6, pp. 307–309.

    Article  MathSciNet  Google Scholar 

  3. Calder, M. and Miller, A., Five Ways to Use Induction and Symmetry in the Verification of Networks of Processes by Model-Checking, Proc. AvoCS 2002 (Automated Verification of Critical Systems), 2002, pp. 29–42.

  4. Clarke, E.M., Grumberg, O., and Jha, S., Verifying Parameterized Networks Using Abstraction and Regular Languages, Proc. 6th International Conference on Concurrency Theory, 1995, pp. 395–407.

  5. Clarke, E.M., Grumberg, O., and Jha, S., Verifying Parameterized Networks, ACM Transactions on Programming Languages and Systems, 1997, vol. 19, no. 5, pp. 726–750.

    Article  Google Scholar 

  6. Clarke, E.M., Grumberg, O., and Peled, D., Model Checking, MIT Press, 2000.

  7. Clarke, E., Talupur, M., Touili, T., and Veith, H., Verification by Network Decomposition, Proc. CONCUR’04, Lecture Notes in Computer Science, 2004, vol. 3170, pp. 276–291.

    Article  Google Scholar 

  8. Emerson, E.A. and Namjoshi, K.S., Reasoning about Rings, Proc. 22th ACM Conf. on Principles of Programming Languages, POPL’95, 1995, pp. 85–94.

  9. Emerson, E.A. and Sistla, A.P., Symmetry and Model Checking, Formal Methods in System Design, 1996, vol. 9, no. 1/2, pp. 105–131.

    Article  Google Scholar 

  10. Gerth, R., Kuiper, R., Peled, D., and Penczek, W., A Partial Order Approach to Branching Time Logic Model Checking, Information and Computation, 1999, vol. 150, no. 2, pp. 132–152.

    Article  MATH  MathSciNet  Google Scholar 

  11. van Glabbeek, R.J. and Weijland, W.P., Branching Time and Abstraction in Bisimulation Semantics, Journal of the ACM, 1996, vol. 43, no. 3, pp. 555–600.

    Article  MATH  MathSciNet  Google Scholar 

  12. Holzmann, G. and Puri, A., A Minimized Automaton Representation of Reachable States, in Software Tools for Technology Transfer, 1998, vol. 3, no. 1, pp. 270–278.

    Google Scholar 

  13. Holzmann, G., The SPIN Model Checker: Primer and Reference Manual, Addison-Wesley Professional, 2003.

  14. Ip, C.N. and Dill, D.L., Verifing Systems with Replicating Components in Murphi, Formal Methods in System Design, 1999, vol. 14, pp. 273–310.

    Article  Google Scholar 

  15. Kesten, Y. and Pnueli, A., Verification by Finitary Abstraction, Information and Computation, 2000, vol. 163, pp. 203–243.

    Article  MATH  MathSciNet  Google Scholar 

  16. Kurshan, R.P. and MacMillan, K.L., Structural Induction Theorem for Processes, Proc. the 8th International Symposium on Principles of Distributed Computing, PODC’89, 1989, pp. 239–247.

  17. Konnov, I.V. and Zakharov, V.A., An Approach to the Verification of Symmetric Parameterized Distributed Systems, Programming and Computer Software, 2005, vol. 31, no. 5, pp. 225–236.

    Article  MATH  MathSciNet  Google Scholar 

  18. Zakharov, V. and Konnov, I., An Invariant-Based Approach to the Verification of Asynchronous Parameterized Networks, International Workshop on Invariant Generation (WING’07), RISC-Linz Report Series no. 07-07. RISC, Hagenberg, Austria, 2007, pp. 41–55.

    Google Scholar 

  19. Lesens, D., Invariants of Parameterized Binary Tree Networks as Greatest Fixpoints, Proc. Sixth International Conference on Algebraic Methodology and Software Technology, AMAST’97, 1997, pp. 337–350.

  20. Lesens, D., Halbwachs, N., and Raymond, P., Automatic Verification of Parameterized Linear Networks of Processes, POPL’97, Proc. the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (ACM, New York, NY, USA, 1997), pp. 346–357.

    Chapter  Google Scholar 

  21. Manku, G.S., Hojati, R., and Brayton, R.K., Structural Symmetries and Model Checking, Proc. International Conference on Computer-Aided Verification (CAV’98), 1998, pp. 159–171.

  22. Marelly, R. and Grumberg, O., Gormel-Grammar Oriented Model Checker, Technical Report 697, The Technion, 1991.

  23. Nilsson, M., Regular Model Checking, PhD Thesis, Uppsala, Sweden: Uppsala University, 2005.

    Google Scholar 

  24. Penczek, W., Gerth, R., Kuiper, R., and Szreter, M., Partial Order Reductions Preserving Simulations, 1999.

  25. Braden, R., Resource Reservation Protocol (RSVP), 1997, http://tools.ietf.org/html/rfc2205.

  26. Shahar, E., Tools and Techniques for Verifying Parameterized Systems, PhD Thesis Weizmann Institute of Science, 2001.

  27. Wolper, P. and Lovinfosse, V., Properties of Large Sets of Processes with Network Invariants, Lecture Notes in Computer Science, 1989, vol. 407, pp. 68–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lomonosov Moscow State University, Moscow, Russia

    I. V. Konnov

Authors
  1. I. V. Konnov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. V. Konnov.

Additional information

Original Russian Text © I.V. Konnov, 2008, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2008, No. 3, pp. 3—13.

The article was translated by the authors.

About this article

Cite this article

Konnov, I.V. On application of weaker simulations to parameterized model checking by network invariants technique. Aut. Conrol Comp. Sci. 44, 378–386 (2010). https://doi.org/10.3103/S0146411610070035

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411610070035

Keywords

Search

Navigation