Skip to main content

A simple and Fast Algorithm to Obtain all Invariants of a Generalised Petri Net

  • Conference paper

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 52))

Abstract

After a linear algebraic characterization of the minimal support invariant concept, it is proposed a very efficient algorithm to calculate all the minimal support invariants of Generalised and Capacity Petri Nets.

Finally,it is presented a graphycal interpretation of the algorithm execution process. It may be considered as a reduction rule that non preserves liveness.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Agerwala T.: Putting Petri Nets to Work. Computer, December, pp. 85–94.

    Google Scholar 

  • Andre C., Armand P., Boeri F. Synchronic relations and applications in parallel computation. Digital Process. Vol.5, n°2, pp. 99–113.

    Google Scholar 

  • Berthomieu B.: Analyse structurelle des réseaux de Pétri, Méthodes et outils. Thèse Doc. Ing., Univ. Paul Saba-tier, Toulouse, Septembre.

    Google Scholar 

  • Jensen K.: How to find invariants for Colored Petri Nets. DAIMI PB-120 Computer Science Departament, Aarhus University, May, pp. 1–20.

    Google Scholar 

  • Lautenbach K., Schmid H.A.: Use of Petri Nets for proving correctness of concurrent process systems. IFIP 74 North Holland Pub. Co., pp. 187–191.

    Google Scholar 

  • Lien Y.E.: A Note on Transition Systems. J. Information Science, vol. 10, n°4, June, pp. 251–265.

    Google Scholar 

  • Memmi G., Roucairol G.: Linear algebra in net theory. Advanced Course on General Net Theory of Process and Systems. Hamburg, October. Lecture Notes in Computer Science, n°84, Springer Verlag, pp. 213–223.

    Google Scholar 

  • Peterson J.L.: Petri Nets. Computing Surveys, Vol. 9, n°3, September, pp. 223–251.

    Google Scholar 

  • Sifakis J.: Structural properties of Petri Nets. Mathematical Foundations of Computer Science, J. Winkowski Ed., Springer Verlag, pp. 474–483.

    Google Scholar 

  • SILV 8l] Silva M.: Las Redes de Petri en la Automâtica y la Informâtica Editorial AC, Madrid, in press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martínez, J., Silva, M. (1982). A simple and Fast Algorithm to Obtain all Invariants of a Generalised Petri Net. In: Girault, C., Reisig, W. (eds) Application and Theory of Petri Nets. Informatik-Fachberichte, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68353-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68353-4_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11189-4

  • Online ISBN: 978-3-642-68353-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics