Skip to main content
SpringerLink
Log in

An efficient algorithm for the computation of stubborn sets of well formed Petri Nets

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1995 (ICATPN 1995)

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

Included in the following conference series:

Abstract

The state space analysis of a Petri Net allows the validation of system properties but its drawback is the explosion in time and space. The Stubborn Set method of A. Valmari, permits an efficient reduction of the graph based on the parallelism expressed by the model. Colored Petri Nets introduce new complexities for the computation of Stubborn Sets due to the color management. For Well Formed Colored Petri Nets, we present an efficient implementation of the Stubborn Set method based on the solving of constraint systems. These systems represent the dependences between transitions induced by the Stubborn Set definition. They are constructed before the graph generation in a symbolic form independently of the system parameters. These constraint systems are repetitively solved during the graph construction.

This work has been supported by the Indo-French Center for the Promotion of Advanced Research (IFCPAR), Project 302-1.

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.

References

  1. J.M. Bernard, J.L. Mounier, N. Beldiceanu, S. Haddad: «AMI: An Extensible Petri Nets Interactive Workshop», Proceeding of the 9th European Workshop on Application and Theory of Petri Nets, Venice, Italy, June 1988, pp. 101–117.

    Google Scholar 

  2. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad: «On Well Formed Colored Petri Nets and their Symbolic Reachability Graph», In: «High Level Petri Nets. Theory and Application», K.Jensen & G. Rozenberg (eds.), Springer-Verlag, 1991, pp.373–396.

    Google Scholar 

  3. G. Chiola, G. Franceschinis, R. Gaeta: «A Symbolic Simulation Mechanism for Well Formed Colored Petri Nets», Proceeding of the 25th Simulation Symposium, Orlando, Florida, 1992.

    Google Scholar 

  4. C. Dutheillet: «Symétries dans les réseaux colorés. définition, analyse et application à l'évaluation de performances», Thèse de Doctorat, Université P. et M.Curie, Mars 1992.

    Google Scholar 

  5. C. Dutheillet, S. Haddad: «Conflict Sets in Colored Petri Nets», Proceedings of the 5th International Workshop on Petri Nets and Performance Models, IEEE-CS Press, Toulouse, France, October 1993, pp. 76–85.

    Google Scholar 

  6. A. Finkel: «A Minimal Coverability Graph for Petri Nets», Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris 1990, pp. 1–21.

    Google Scholar 

  7. P. Grönberg, M. Tiusanen, K. Varpaaniemi: «PROD-A Pt/T-Net Reachability Analysis Tool», Helsinki University of Technology, Digital Systems Laboratory Report B 11, Espoo 1993.

    Google Scholar 

  8. P. Huber, A.M. Jensen, L.O. Jepsen & K. Jensen: «Reachability Trees for High-level Petri Nets», In: «High Level Petri Nets. Theory and Application», K.Jensen & G. Rozenberg (eds.), Springer-Verlag, 1991, pp. 319–350.

    Google Scholar 

  9. J-M. Ilié, O. Rojas: «On Well Formed Nets and Optimizations in Enabling Tests», Proceedings of the 14th International Conference on Application and Theory of Petri Nets, Chicago 1993, pp. 300–318.

    Google Scholar 

  10. K. Jensen: «Coloured Petri Nets», In: W.Brauer, W. Reisid, G. Rozenberg (eds); «Petri Nets: Central Model and their Properties», Lecture Notes in Computer Science 254, Springer Verlag, 1987, pp. 248–299.

    Google Scholar 

  11. K. Jensen: «Coloured Petri Nets: A high Level Language for System Design and Analysis», In: «High Level Petri Nets. Theory and Application», K.Jensen & G. Rozenberg (eds.), Springer-Verlag, 1991, pp. 44–122.

    Google Scholar 

  12. A. Valmari: «Stubborn Sets for Reduced State Space Generation», In: G. Rozenberg (ed.); Advances in Petri Nets 1990, Lecture Notes in Computer Science vol. 483, Springer-Verlag 1991, pp. 491–515.

    Google Scholar 

  13. A. Valmari: «Stubborn Sets of Coloured Petri Nets», In: G. Rozenberg (ed.); Advances in Petri Nets 1992, Lecture Notes in Computer Science, Springer-Verlag 1992.

    Google Scholar 

  14. K. Varpaaniemi, M. Rauhamaa: «The Stubborn Set Method in Practice», Jensen K.(ed), Proceedings of the 13th International Conference on Application and Theory of Petri Nets, Sheffield 1992. Lecture Notes in Computer Science vol. 616, Springer-Verlag, Berlin 1992, pp. 389–393.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire MASI, Institut Blaise Pascal, Université Paris VI, 4, Place Jussieu, 75252, Paris Cedex 05, France

    Robert Brgan & Denis Poitrenaud

Authors
  1. Robert Brgan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Denis Poitrenaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio De Michelis Michel Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brgan, R., Poitrenaud, D. (1995). An efficient algorithm for the computation of stubborn sets of well formed Petri Nets. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-60029-9_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60029-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation