Skip to main content
SpringerLink
Log in

On the model of computation of place/transition Petri nets

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

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

Included in the following conference series:

Abstract

In the last few years, the sematics of Petri nets has been investigated in several different ways. Apart from the classical “token game”, one can model the behaviour of Petri nets via non-sequential processes, via unfolding constructions, which provide formal relationships between nets and domains, and via algebraic models, which view Petri nets as essentially algebraic theories whose models are monoidal categories.

In this paper we show that these three points of view can be reconciled. More precisely, we introduce the new notion of decorated processes of Petri nets and we show that they induce on nets the same semantics as that of unfolding. In addition, we prove that the decorated processes of a net N can be axiomatized as the arrows of a symmetric monoidal category which, therefore, provides the aforesaid unification.

Supported by Office of Naval Research Contract N00014-92-C-0518, National Science Foundation Grant CCR-9224005, and by the Information Technology Promotion Agency, Japan, as a part of the R & D of Basic Technology for Future Industries “New Models for Software Architecture” sponsored by NEDO (New Energy and Industrial Technology Development Organization).

Partially supported by the EU SCIENCE Programme, Project MASK, and by the Italian National Research Council (CNR), Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, obiettivo Lambrusco.

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. G. Berry. Stable Models of Typed λ-calculi. In Proceedings ICALP '78, LNCS n. 62, pp. 72–89, 1978.

    Google Scholar 

  2. E. Best, and R. Devillers. Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science, n. 55, pp. 87–136, 1987.

    Google Scholar 

  3. C. Brown, and D. Gurr. A Categorical Linear Framework for Petri Nets. In Proceedings of the 5th LICS Symposium, pp. 208–218, 1990.

    Google Scholar 

  4. C. Brown, D. Gurr, and V. de Paiva. A Linear Specification Language for Petri Nets. Technical Report DAIMI PB-363, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing Net Computations and Processes. In Proceedings of the 4th LICS Symposium, pp. 175–185, IEEE, 1989.

    Google Scholar 

  7. J. Engelfriet. Branching Processes of Petri Nets. Acta Informatica, n. 28, pp. 575–591, 1991.

    Google Scholar 

  8. U. Goltz, and W. Reisig. The Non-Sequential Behaviour of Petri Nets. Information and Computation, n. 57, pp. 125–147, 1983.

    Google Scholar 

  9. P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. Local Event Structures and Petri Nets In Proceedings of CONCUR '93, LNCS n. 715, pp. 462–476, Springer-Verlag, 1993.

    Google Scholar 

  10. S. MacLane. Categories for the Working Mathematician. Springer-Verlag, 1971.

    Google Scholar 

  11. J. Meseguer, and U. Montanari. Petri Nets are Monoids. Information and Computation, n. 88, pp. 105–154, Academic Press, 1990.

    Google Scholar 

  12. J. Meseguer, U. Montanari, and V. Sassone. On the Semantics of Petri Nets. In proceedings of CONCUR '92, LNCS, n. 630, pp. 286–301, Springer-Verlag, 1992.

    Google Scholar 

  13. J. Meseguer, U. Montanari and V. Sassone. On the Semantics of Place/Transition Petri Nets. Technical Report TR 27/92 Dipartimento Informatica, Università di Pisa, 1992, and Technical Report SRI-CSL-92-09, SRI International, Computer Science Laboratory, 1992.

    Google Scholar 

  14. J. Meseguer, U. Montanari and V. Sassone. Process versus Unfolding Semantics for PT Place/Transition Petri Nets To appear as Technical Report of the Dipartimento di Informatica, Università di Pisa, and Technical Report of the Computer Science Laboratory, SRI International, 1994.

    Google Scholar 

  15. M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, n. 13, pp. 85–108, 1981.

    Article  Google Scholar 

  16. M. Nielsen, G. Rozenberg, and P.S. Thiagarajan. Behavioural Notions for Elementary Net Systems. Distributed Computing, n. 4, pp. 45–57, 1990.

    Google Scholar 

  17. 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 

  18. C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, Germany, 1962.

    Google Scholar 

  19. 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 

  20. C.A. Petri. Non-Sequential Processes. Interner Bericht ISF-77-5, Gesellschaft für Mathematik und Datenverarbeitung, Bonn, FRG, 1977.

    Google Scholar 

  21. W. Reisig. Petri Nets. Springer-Verlag, 1985.

    Google Scholar 

  22. V. Sassone. On the Semantics of Petri Nets: Processes, Unfoldings and Infinite Computations. PhD Thesis, TD 6/94 Dipartimento di Informatica, Università di Pisa, March 1994.

    Google Scholar 

  23. V. Sassone. Some Remarks on Concatenable Processes. Technical Report TR 6/94, Dipartimento di Informatica, Università di Pisa, April 1994.

    Google Scholar 

  24. V. Sassone, J. Meseguer, and U. Montanari. ω-Ind Completion of Monoidal Categories and Infinite Petri Net Computations. Presentation at the Workshop on Topology and Completion in Sematics, Institute Blaise Pascal, November 1993, Chartres, France. To appear as Technical Report of the Dipartimento di Informatica, Università di Pisa, and Technical Report of the Computer Science Laboratory, SRI International, 1994.

    Google Scholar 

  25. 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 

  26. R. Van Glabbeek, and F. Vaandrager. Petri Net Models for Algebraic Theories of Concurrency. In proceedings of PARLE, LNCS, n. 259, pp. 224–242, Springer-Verlag, 1987.

    Google Scholar 

  27. G. Winskel. Event Structure Semantics of CCS and Related Languages. In proceedings of ICALP '82, LNCS n. 140, pp. 561–567, Springer-Verlag, 1982. Expanded version available as technical report DAIMI PB-159, Computer Science Department, Aarhus University.

    Google Scholar 

  28. G. Winskel. Event Structures. In proceedings of Advanced Course on Petri Nets, LNCS, n. 255, pp. 325–392, Springer-Verlag, 1987.

    Google Scholar 

  29. G. Winskel. Petri Nets, Algebras, Morphisms and Compositionality. Information and Computation, n. 72, pp. 197–238, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SRI International, 94025, Menlo Park, CA, USA

    José Meseguer

  2. Dipartimento di Informatica, Università di Pisa, Italy

    Ugo Montanari & Vladimiro Sassone

Authors
  1. José Meseguer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vladimiro Sassone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Valette

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meseguer, J., Montanari, U., Sassone, V. (1994). On the model of computation of place/transition Petri nets. In: Valette, R. (eds) Application and Theory of Petri Nets 1994. ICATPN 1994. Lecture Notes in Computer Science, vol 815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58152-9_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-58152-9_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48462-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation