Skip to main content
SpringerLink
Log in

Optimal simulations, nets and reachability graphs

  • Conference paper
  • First Online:
Advances in Petri Nets 1991 (ICATPN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 524))

Included in the following conference series:

Abstract

Reasoning about the dynamic properties of a concurrent system can be made easier by avoiding the combinatorial explosion of its state space. One of the ways in which this might be achieved is by using the optimal simulation - a kind of reachability relation on the system's histories. The optimal simulation usually involves only a very small subset of the possible behaviours generated by the system, yet provides a sufficient information to reason about a number of interesting system's properties such as deadlock-freeness and liveness. In this paper we present also other properties of that kind. We then show how the optimal simulation can be used to generate a reachability graph which is usually much smaller than the standard reachability graph of the system. In spite of this both graphs essentially convey the same information about the system's behaviour.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. Cartier P., Foata D., Problemes combinatoires de communication et rearrangements, Lecture Notes in Mathematics 85, Springer 1969.

    Google Scholar 

  2. Clarke E.M., Grümberg O., Research on Automatic Verification of Finite-State Concurrent Systems, Ann. Rev. Comp. Sci. 2(1987), 269–290.

    Google Scholar 

  3. Clarke E.M., Emerson E.A., Sistla A.P., Automatic Verification of Finite-State Systems using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems 8(1986), 244–263.

    Google Scholar 

  4. Godefroid P., Using Partial Orders to Improve Automatic Verification Methods, Proc. of the Computer-Aided Verification Workshop, 1990, to appear in the Lecture Notes in Computer Science.

    Google Scholar 

  5. Hennessy M. and Milner R., Algebraic Laws for Nondeterminism and Concurrency, JACM 32(1985), 136–161.

    Google Scholar 

  6. Hoare C.A.R., Communicating Sequential Processes, Prentice-Hall, 1985.

    Google Scholar 

  7. Janicki R., Lauer P.E., Koutny M., Devillers R., Concurrent and Maximally Concurrent Evolution of Non-Sequential Systems, Theoretical Computer Science 43(1986), 213–238.

    Google Scholar 

  8. Janicki R., Koutny M., Towards a Theory of Simulation for Verification of Concurrent Systems, Lecture Notes in Computer Science 366, Springer 1989, 73–88.

    Google Scholar 

  9. Janicki R., Koutny M., Optimal Simulation for Verification of Concurrent Systems, Technical Report No. 89-05, McMaster University,Hamilton, Ontario, 1989.

    Google Scholar 

  10. Janicki R., Koutny M., Net Implementation of Optimal Simulation, in: Proc. of the 11th Conference on Application and Theory of Petri Nets, Paris, June 1990, pp. 295–314.

    Google Scholar 

  11. Janicki R., Koutny M., Using Optimal Simulations to Reduce Reachability Graphs, Proc. of the Computer-Aided Verification Workshop, 1990, to appear in the Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  12. Jensen K., Coloured Petri Nets, LNCS 254, Springer 1987, pp. 248–299.

    Google Scholar 

  13. Keller R.M., Formal Verification of Concurrent Programs, CACM 19(7), 1976, 371–384.

    Google Scholar 

  14. Lauer P.E., Shields M.W., Cotronis J.Y., Formal Behavioural Specification of Concurrent Systems without Globality Assumptions, Lecture Notes in Computer Science 107, Springer 1981, 115–151.

    Google Scholar 

  15. Martinez J., Silva M., A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net, Informatik-Fachberichte 52, Springer 1982, 301–310.

    Google Scholar 

  16. Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, DAIMI-PB-78, Aarhus University, 1977.

    Google Scholar 

  17. Mazurkiewicz A., Trace Theory, Lecture Notes in Computer Science 255, Springer 1986, 297–324.

    Google Scholar 

  18. Milner R., A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer 1980.

    Google Scholar 

  19. Morgan E.T, Razouk R.R., Interactive State-Space Analysis of Concurrent Systems, IEEE Transactions on Software Engineering 13(10), 1987.

    Google Scholar 

  20. Reisig W., Petri Nets, Springer 1985.

    Google Scholar 

  21. Taubner D., Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, Lecture Notes in Computer Science 369, Springer 1989.

    Google Scholar 

  22. Valmari A., Stubborn Sets for Reduced State Space Generation, Proceedings of the 10th International Conference on Application and Theory of Petri Nets, Bonn, June 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Ryszard Janicki

  2. Computing Laboratory, The University of Newcastle upon Tyne, NE1 7RU, Newcastle upon Tyne, U.K.

    Maciej Koutny

Authors
  1. Ryszard Janicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janicki, R., Koutny, M. (1991). Optimal simulations, nets and reachability graphs. In: Rozenberg, G. (eds) Advances in Petri Nets 1991. ICATPN 1990. Lecture Notes in Computer Science, vol 524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019976

Download citation

  • DOI: https://doi.org/10.1007/BFb0019976

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54398-5

  • Online ISBN: 978-3-540-47600-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation