Skip to main content

Pre-nets, Read Arcs and Unfolding: A Functorial Presentation

  • Conference paper

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

Abstract

Pre-nets have been recently proposed as a means of providing a functorial algebraic semantics to Petri nets (possibly with read arcs), overcoming some previously unsolved subtleties of the classical model. Here we develop a functorial semantics for pre-nets following a sibling classical approach based on an unfolding construction. Any pre-net is mapped to an acyclic branching net, representing its behaviour, then to a prime event structure and finally to a finitary prime algebraic domain. Then the algebraic and unfolding view are reconciled: we exploit the algebraic semantics to define a functor from the category of pre-nets to the category of domains that is shown to be naturally isomorphic to the unfolding-based functor. All the results are extended to pre-nets with read arcs.

Research supported by the FET-GC Project IST-2001-32747 Agile and by the MIUR Project COFIN 2001013518 CoMeta. The second author is also supported by an Italian cnr fellowship for research on Information Sciences and Technologies, and by the CS Department of the University of Illinois at Urbana-Champaign.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

  1. Baldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Inform. and Comput. 1(171), 1–49 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Best, E., Devillers, R.: Sequential and concurrent behaviour in Petri net theory. Theoret. Comput. Sci. 55, 87–136 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berry, G.: Stable models of typed lambda-calculi. In: Ausiello, G., Böhm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 72–89. Springer, Heidelberg (1978)

    Chapter  Google Scholar 

  4. Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Functorial semantics for Petri nets under the individual token philosophy. In: Proceedings of CTCS 1999. Elect. Notes in Th. Comput. Sci., vol. 29. Elsevier Science, Amsterdam (1999)

    Google Scholar 

  5. Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Functorial models for Petri nets. Inform. and Comput. 170(2), 207–236 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bruni, R., Meseguer, J., Montanari, U., Sassone, V.: Functorial models for contextual pre-nets. Technical Report TR-02-09, University of Pisa (2002)

    Google Scholar 

  7. Crazzolara, F., Winskel, G.: Events in security protocols. In: Proceedings of CCS 2001, pp. 96–105. ACM, New York (2001)

    Google Scholar 

  8. De Francesco, N., Montanari, U., Ristori, G.: Modeling concurrent accesses to shared data via Petri nets. In: Programming Concepts, Methods and Calculi. IFIP Transactions, vol. A-56, pp. 403–422. North Holland, Amsterdam (1994)

    Google Scholar 

  9. Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the algebra of net computations and processes. Acta Inform. 33(7), 641–667 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. van Glabbeek, R.J., Plotkin, G.D.: Configuration structures. In: Proceedings of LICS 1995, pp. 199–209. IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

  11. Goltz, U., Reisig, W.: The non-sequential behaviour of Petri nets. Inform. And Comput. 57, 125–147 (1983)

    MATH  Google Scholar 

  12. MacLane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1971)

    MATH  Google Scholar 

  13. Meseguer, J., Montanari, U.: Petri nets are monoids. Inform. and Comput. 88, 105–155 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  14. Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Petri nets. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 286–301. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  15. Meseguer, J., Montanari, U., Sassone, V.: Process versus unfolding semantics for Place/Transition Petri nets. Theoret. Comput. Sci. 153(1-2), 171–210 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Meseguer, J., Montanari, U., Sassone, V.: On the semantics of Place/Transition Petri nets. Math. Struct. in Comput. Sci. 7, 359–397 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Meseguer, J., Montanari, U., Sassone, V.: Representation theorems for Petri nets. In: Freksa, C., Jantzen, M., Valk, R. (eds.) Foundations of Computer Science. LNCS, vol. 1337, pp. 239–249. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  18. Montanari, U., Rossi, F.: Contextual occurrence nets and concurrent constraint programming. In: Ehrig, H., Schneider, H.-J. (eds.) Dagstuhl Seminar 1993. LNCS, vol. 776, pp. 280–295. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  19. Montanari, U., Rossi, F.: Contextual nets. Acta Inform. 32, 545–596 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  20. Nielsen, M., Plotkin, G., Winskel, G.: Petri Nets, Event Structures and Domains, Part 1. Theoret. Comput. Sci. 13, 85–108 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  21. Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Schriften des Institutes für Instrumentelle Matematik, Bonn (1962)

    Google Scholar 

  22. Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)

    Book  MATH  Google Scholar 

  23. Sassone, V.: An axiomatization of the category of Petri net computations. Math. Struct. in Comput. Sci. 8(2), 117–151 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  24. Vogler, W.: Efficiency of asynchronous systems and read arcs in Petri nets. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 538–548. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  25. Brauer, W., Reisig, W., Rozenberg, G. (eds.): APN 1986. LNCS, vol. 255. Springer, Heidelberg (1987)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baldan, P., Bruni, R., Montanari, U. (2003). Pre-nets, Read Arcs and Unfolding: A Functorial Presentation. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds) Recent Trends in Algebraic Development Techniques. WADT 2002. Lecture Notes in Computer Science, vol 2755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40020-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40020-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20537-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics