Skip to main content

A uniform approach to Petri Nets

  • Chapter
  • First Online:
Foundations of Computer Science

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

Abstract

The new concept of universal parameterized net classes is introduced in order to allow a uniform approach to different kinds of Petri net classes. By different actualizations of the net structure parameter and the data type parameter we obtain several well-known net classes, like elementary nets, place-transition nets, colored nets, predicate transition nets, and algebraic high-level nets, as well as several interesting new classes of low- and high-level nets. While the basic concept of parameterized net classes is defined on a purely set theoretical level the extended concept of universal parameterized net classes takes into account also morphisms and universal properties in the sense of category theory. This allows to discuss general constructions and compatibility results concerning union and fusion of nets for different types of net classes.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Adamek, H. Herrlich, and G. Strecker, Abstract and concrete categories, Series in Pure and Applied Mathematics, John Wiley and Sons, 1990.

    Google Scholar 

  2. E. Battiston, F. De Cindio, and G. Mauri, OBJSA nets: a class of high-level nets having objects as domains, Advances in Petri nets (G. Rozenberg, ed.), vol. 340, Springer Verlag Berlin, 1988, pp. 20–43.

    Google Scholar 

  3. E. Best, R. Devillers, and J. Hall, The Box Calculus: a new causal algebra with multi-label communication, Advances in Petri Nets, 1992, 609, pp. 21–69.

    MathSciNet  Google Scholar 

  4. W. Brauer, R. Gold, and W. Vogler, A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets, Advances in Petri Nets, LNCS 483 (1990).

    Google Scholar 

  5. W. Brauer (ed.), Net Theory and Aplications, Springer, LNCS 84, 1980.

    Google Scholar 

  6. Wilfried Brauer, How to play the token game, Petri Net Newsletter 16 (1984), 3–13.

    Google Scholar 

  7. W. Brauer, W. Reisig, and G. Rozenberg (eds.), Petri Nets: Applications and Relations to Other Models of Concurrency, Springer, LNCS 255, 1987.

    Google Scholar 

  8. W. Brauer, W. Reisig, and G. Rozenberg (eds.), Petri Nets: Central Models and Their Properties, Springer, LNCS 254, 1987.

    Google Scholar 

  9. H. Ehrig, M. Große-Rhode, and A. Heise, Specification techniques for concurrent and distributed systems, Tech. Report 92/5, Jan. 1992.

    Google Scholar 

  10. H. Ehrig, M. Große-Rhode, and Uwe Wolter, On the role of category theory in the area of algebraic specifications, LNCS, Proc. WADT11, Oslo, 1996.

    Google Scholar 

  11. H. Ehrig and B. Mahr, Fundamentals of algebraic specifications 1: Equations and initial semantics, EACTS Monographs on Theoretical Computer Science, vol. 6, Berlin, 1985.

    Google Scholar 

  12. H. Ehrig and W. Reisig, Integration of Algebraic Specifications and Petri Nets, Bulletin EATCS, Formal Specification Column (1996), submitted.

    Google Scholar 

  13. H.J. Genrich and K. Lautenbach, System modelling with high-level Petri nets, 109–136.

    Google Scholar 

  14. K. Jensen, Coloured petri nets and the invariant method, 317–336.

    Google Scholar 

  15. Kurt Jensen, Coloured Petri nets. basic concepts, analysis methods and practical use, vol. 1, Springer, 1992.

    Google Scholar 

  16. H. Klaudel and E. Pelz, Communication as unification in the Petri Box Calculus, Tech. report, LRI, Universite de Paris Sud, 1995.

    Google Scholar 

  17. J. Meseguer and U. Montanari, Petri nets are monoids, Information and Computation 88 (1990), no. 2, 105–155.

    Article  MathSciNet  MATH  Google Scholar 

  18. J. Padberg, Abstract Petri Nets: A Uniform Approach and Rule-Based Refinement, Ph.D. thesis, Technical University Berlin, 1996, Shaker Verlag.

    Google Scholar 

  19. J. Padberg, H. Ehrig, and L. Ribeiro, Algebraic high-level net transformation systems, Mathematical Structures in Computer Science 5 (1995), 217–256.

    Article  MathSciNet  MATH  Google Scholar 

  20. W. Reisig, Petri nets, EATCS Monographs on Theoretical Computer Science, vol. 4, Springer-Verlag, 1985.

    Google Scholar 

  21. W. Reisig, Petri nets and abstract data types, Theoretical Computer Science 80 (1991), 1–34 (fundamental studies).

    Article  MATH  MathSciNet  Google Scholar 

  22. G. Rozenberg and P.S. Thiagarajan, Petri nets: Basic notions, structure, behaviour, Current Trends in Concurrency, 1986, 224, pp. 585–668.

    Article  MathSciNet  Google Scholar 

  23. J. Vautherin, Parallel specification with coloured Petri nets and algebraic data types, Proc. of the 7th European Workshop on Application and Theory of Petri nets (Oxford, England), jul. 1986, pp. 5–23.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Christian Freksa Matthias Jantzen Rüdiger Valk

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ehrig, H., Padberg, J. (1997). A uniform approach to Petri Nets. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052090

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63746-2

  • Online ISBN: 978-3-540-69640-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics