On the semantics of Petri Nets

  • José Meseguer
  • Ugo Montanari
  • Vladimiro Sassone
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 630)


Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the “token game” is too intensional, even in its more abstract interpretations in term of nonsequential processes and monoidal categories; on the other hand, Winskel's basic unfolding construction, which provides a coreflection between nets and finitary prime algebraic domains, works only for safe nets.

In this paper we extend Winskel's result to PT nets. We start with a rather general categoryPTNetsof PT nets, we introduce a categoryDccOccof decorated (nondelerministic) occurrence nets and we define adjunctions betweenPTNetsandDecOccand betweenDecOccandOcc, the category of occurrence nets. The role ofDecOccis to provide natural unfoldings for PT nets, i.e. acyclic safe nets where a notion of family is used for relating multiple instances of the same place.

The unfolding functor fromPTNetstoOccreduces to Winskel's when restricted to safe nets, while the standard coreflection betweenOccandDom, the category of finitary prime algebraic domains, when composed with the unfolding functor above, determines a chain of adjunctions betweenPTNetsandDom.


Full Subcategory Monoidal Category Left Adjoint Forgetful Functor Place Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BD87]
    E. Best, and R. Devillers. Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science, n. 55, pp. 87–135, 1987.MathSciNetCrossRefGoogle Scholar
  2. [DDM88]
    P. Degano, R. De Nicola, and U. Montanari. A Distributed Operational Semantics for CCS based on Condition/Event Systems. Acta Informatica, n. 26, pp. 59–91, 1988.CrossRefGoogle Scholar
  3. [DMM89]
    P. Degano, J. Meseguer, and U. Montanari. Axiomatizing Net Computations and Processes. In proceedings of 4 th LICS Symposium, pp. 175–185, IEEE, 1989.Google Scholar
  4. [Eng91]
    J. Engelfriet. Branching Processes of Petri Nets. Acta Information, n. 28, pp. 575–591, 1991.MathSciNetCrossRefGoogle Scholar
  5. [GR83]
    U. Goltz, and W. Reisig. The Non-Sequential Behaviour of Petri Nets. Information and Computation, n. 57, pp. 125–147, 1983.MathSciNetGoogle Scholar
  6. [HKT92]
    P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. A Trace Semantics for Petri Nets. To appear in proceedings of ICALP '92, 1992.Google Scholar
  7. [ML71]
    S. MacLane. Categories for the Working Mathematician. GTM, Springer-Verlag, 1971.Google Scholar
  8. [MM90]
    J. Meseguer, and U. Montanari. Petri Nets are Monoids. Information and Computation, n. 88, pp. 105–155, 1990.MathSciNetCrossRefGoogle Scholar
  9. [NPW81]
    M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, n. 13, pp. 85–108, 1981.MathSciNetCrossRefGoogle Scholar
  10. [Old87]
    E.R. Olderog. A Petri Net Semantics for CCSP. In Advances in Petri Nets, LNCS, n. 255, pp. 196–223, Springer-Verlag, 1987.Google Scholar
  11. [Pet62]
    C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, FRG, 1962.Google Scholar
  12. [Pet73]
    C.A. Petri. Concepts of Net Theory. In proceedings of MFCS '73, pp. 137–146, Mathematics Institute of the Slovak Academy of Science, 1973.Google Scholar
  13. [Pet77]
    C.A. Petri. Non-Sequential Processes. Interner Bericht ISF-77-5, Gesellschaft für Mathematik and Datenverarbeitung, Bonn, FRG, 1977.Google Scholar
  14. [Pra91]
    V. Pratt. Modeling Concurrency with Geometry. In proceedings of POPL '91, pp. 311–322, ACM, 1991.Google Scholar
  15. [Rei85]
    W. Reisig. Petri Nets. Springer-Verlag, 1985.Google Scholar
  16. [Sco70]
    D. Scott. Outline of a Mathematical Theory of Computation. In proceedings of 4th Annual Princeton Conference on Information Science and Systems, pp. 169–176, 1970.Google Scholar
  17. [vGV87]
    R. Van Glabbeek, and F. Vaandrager. Petri Net Model for Algebraic Theories of Concurrency. In proceedings of PARLE, LNCS, n. 259, pp. 224–242, Springer-Verlag, 1987.Google Scholar
  18. [Win82]
    G. Winskel. Event Structure Semantics for CCS and related languages. In proceedings of the 9th ICALP, LNCS, n. 140, pp. 561–576, Springer-Verlag, 1982.Google Scholar
  19. [Win84]
    G. Winskel. A New Definition of Morphism on Petri Nets. In proceedings of STACS '84, LNCS, n. 166, pp. 140–150, Springer-Verlag, 1984.Google Scholar
  20. [Win86]
    G. Winskel. Event Structures. In proceedings of Advanced Course on Petri Nets, LNCS n. 255, pp. 325–392, Springer-Verlag, 1987.Google Scholar
  21. [Win87]
    G. Winskel. Petri Nets, Algebras, Morphisms and Compositionality. Information and Computation, n. 72, pp. 197–238, 1987.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • José Meseguer
    • 1
  • Ugo Montanari
    • 2
  • Vladimiro Sassone
    • 2
  1. 1.SRI InternationalMenlo Park
  2. 2.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations