Skip to main content
SpringerLink
Log in
Book cover

Unifying Petri Nets pp 380–426Cite as

Transactions and Zero-Safe Nets

  • Chapter
  • First Online:

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

Abstract

When employing Petri nets to model distributed systems, one must be aware that the basic activities of each component can vary in duration and can involve smaller internal activities, i.e., that transitions are conceptually refined into transactions. We present an approach to the modeling of transactions based on zero-safe nets. They extend ordinary pt nets with a simple mechanism for transition synchronization. We show that the net theory developed under the two most widely adopted semantic interpretations (collective token and individual token philosophies) can be uniformly adapted to zero-safe nets. In particular, we show that each zero-safe net has two associated pt nets that represent the abstract counterparts of the modeled system according to these two philosophies. We show several applications of the framework, a distributed interpreter for zs nets based on classical net unfolding (here extended with a commit rule) and discuss some extensions to other net flavours to show that the concept of zero place provides a unifying notion of transaction for several different kinds of Petri nets.

Research supported by CNR Integrated Project Progettazione e Verifica di Sistemi Eterogenei Connessi mediante Reti; by TMR Project GETGRATS; by Esprit Working Group APPLIGRAPH; and by MURST project TOSCa: Tipi, Ordine Superiore e Concorrenza.

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

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. T. Agerwala. A complete model for representing the coordination of asynchronous processes. Hopkins Computer Research Report 32, John Hopkins University, 1974.

    Google Scholar 

  2. T. Agerwala and M. Flynn. Comments on capabilities, limitations and “correctness” of Petri nets. Computer Architecture News, 4(2):81–86, 1973.

    Article  Google Scholar 

  3. P. Baldan. Modelling concurrent computations: From contextual Petri nets to graph grammars. PhD thesis, Computer Science Department, University of Pisa, 2000. Published as Technical Report TD-1/00.

    Google Scholar 

  4. P. Baldan, A. Corradini, and U. Montanari. An event structure semantics for P/T contextual nets: Asymmetric event structures. In M. Nivat, editor, Proceedings of FoSSaCS’98, 1st International Conference on Foundations of Software Science and Computation Structures, volume 1378 of Lect. Notes in Comput. Sci., pages 63–80. Springer Verlag, 1999.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Best, R. Devillers, and J. Esparza. General refinement and recursion for the Petri Box calculus. In P. Enjalbert, A. Finkel, and K.W. Wagner, editors, Proceedings STACS’93, volume 665 of Lect. Notes in Comput. Sci., pages 130–140. Springer Verlag, 1993.

    Google Scholar 

  7. E. Best, R. Devillers, and J. Hall. The Box calculus: A new causal algebra with multi-label communication. In G. Rozenberg, editor, Advances in Petri Nets’92, volume 609 of Lect. Notes in Comput. Sci., pages 21–69. Springer Verlag, 1992.

    Google Scholar 

  8. W. Brauer, R. Gold, and W. Vogler. A survey of behaviour and equivalence preserving refinements of Petri nets. In G. Rozenberg, editor, Advances in Petri Nets’90, volume 483 of Lect. Notes in Comput. Sci., pages 1–46. Springer Verlag, 1991.

    Google Scholar 

  9. C. Brown and D. Gurr. A categorical linear framework for Petri nets. In Proceedings of LICS’90, 5th Annual IEEE Symposium on Logic in Computer Science, pages 208–218. IEEE Computer Society Press, 1990.

    Google Scholar 

  10. R. Bruni. Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Computer Science Department, University of Pisa, 1999. Published as Technical Report TD-1/99.

    Google Scholar 

  11. R. Bruni, J. Meseguer, U. Montanari, and V. Sassone. A comparison of petri net semantics under the collective token philosophy. In J. Hsiang and A. Ohori, editors, Proceedings of ASIAN’98, 4th Asian Computing Science Conference, volume 1538 of Lect. Notes in Comput. Sci., pages 225–244. Springer Verlag, 1998.

    Google Scholar 

  12. R. Bruni, J. Meseguer, U. Montanari, and V. Sassone. Functorial semantics for petri nets under the individual token philosophy. In M. Hofmann, G. Rosolini, and D. Pavlovic, editors, Proceedings of CTCS’99, 8th Category Theory and Computer Science, volume 29 of Elect. Notes in Th. Comput. Sci. Elsevier Science, 1999.

    Google Scholar 

  13. R. Bruni and U. Montanari. Zero-safe nets, or transition synchronization made simple. In C. Palamidessi and J. Parrow, editors, Proceedings EXPRESS’97, 4th workshop on Expressiveness in Concurrency, volume 7 of Elect. Notes in Th. Comput. Sci. Elsevier Science, 1997.

    Google Scholar 

  14. R. Bruni and U. Montanari. Zero-safe nets: The individual token approach. In F. Parisi-Presicce, editor, WADT’97, 12th workshop on Recent Trends in Algebraic Development Techniques, volume 1376 of Lect. Notes in Comput. Sci., pages 122–140. Springer Verlag, 1998.

    Google Scholar 

  15. R. Bruni and U. Montanari. Zero-safe nets: Composing nets via transition synchronization. In H. Weber, H. Ehrig, and W. Reisig, editors, Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems, pages 43–80. Fraunhofer Gesellschaft ISST, 1999.

    Google Scholar 

  16. R. Bruni and U. Montanari. Executing transactions in zero-safe nets. In M. Nielsen and D. Simpson, editors, Proceedings of ICATPN2000, 21st Int. Conf. on Application and Theory of Petri Nets, volume 1825 of Lect. Notes in Comput. Sci., pages 83–102. Springer Verlag, 2000.

    Google Scholar 

  17. R. Bruni and U. Montanari. Zero-safe nets: Comparing the collective and individual token approaches. Inform. and Comput., 156:46–89, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. Bruni and V. Sassone. Algebraic models for contextual nets. In U. Montanari, J.D.P. Rolim, and E. Welzl, editors, Proceedings of ICALP2000, 27th Int. Coll. on Automata, Languages and Programming, volume 1853 of Lect. Notes in Comput. Sci., pages 175–186. Springer Verlag, 2000.

    Google Scholar 

  19. R. Bruni and V. Sassone. Two algebraic process semantics for contextual nets. This Volume.

    Google Scholar 

  20. N. Busi. On zero safe nets, April 1999. Private communication.

    Google Scholar 

  21. N. De Francesco, U. Montanari, and G. Ristori. Modeling concurrent accesses to shared data via Petri nets. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, IFIP Transactions A-56, pages 403–422. North Holland, 1994.

    Google Scholar 

  22. P. Degano, R. De Nicola, and U. Montanari. A distributed operational semantics for CCS based on condition/event systems. Acta Inform., 26(1-2):59–91, 1988.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  24. H. Ehrig and J. Padberg. Uniform approach to Petri nets. In C. Freska, M. Jantzen, and R. Valk, editors, Proceedings Foundations of Computer Science: Potential-Theory-Cognition, volume 1337 of Lect. Notes in Comput. Sci., pages 219–231. Springer Verlag, 1997.

    Google Scholar 

  25. R.J. van Glabbeek. Petri nets, configuration structures and higher dimensional automata. In J.C.M. Baeten and S. Mauw, editors, Proceedings CONCUR’99, volume 1664 of Lect. Notes in Comput. Sci., pages 21–27. Springer Verlag, 1999.

    Google Scholar 

  26. R.J. van Glabbeek and U. Goltz. Refinement of actions and equivalence notions for concurrent systems. Hildesheimer Informatik Bericht 6/98, Institut fuer Informatik, Universitaet Hildesheim, 1998.

    Google Scholar 

  27. R.J. van Glabbeek and G.D. Plotkin. Configuration structures. In D. Kozen, editor, Proceedings of LICS’95, 10th Annual IEEE Symposium on Logics in Computer Science, pages 199–209. IEEE Computer Society Press, 1995.

    Google Scholar 

  28. R.J. van Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Proceedings PARLE, volume 259 of Lect. Notes in Comput. Sci., pages 224–242. Springer Verlag, 1987.

    Google Scholar 

  29. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Inform. and Comput., 57:125–147, 1983.

    MATH  MathSciNet  Google Scholar 

  30. R. Gorrieri and U. Montanari. On the implementation of concurrent calculi into net calculi: Two case studies. Theoret. Comput. Sel, 141(1-2):195–252, 1995.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  33. J. Meseguer, U. Montanari, and V. Sassone. Process versus unfolding semantics for place/transition Petri nets. Theoret. Comput. Sel, 153(1-2):171–210, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  34. J. Meseguer, U. Montanari, and V. Sassone. Representation theorems for Petri nets. In Ch. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential-Theory-Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, volume 1337 of Lect. Notes in Comput. Sci., pages 239–249. Springer Verlag, 1997.

    Google Scholar 

  35. J. Meseguer, P.C. Olveczky, and M.-O. Stehr. Rewriting logic as a unifying framework for Petri nets. This Volume.

    Google Scholar 

  36. U. Montanari and F. Rossi. Contextual nets. Acta Inform., 32:545–596, 1995.

    MATH  MathSciNet  Google Scholar 

  37. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains, part I. Theoret. Comput. Sci., 13:85–108, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  38. E.R. Olderog. Operational Petri net semantics for CCSP. In G. Rozenberg, editor, Advances in Petri Nets’87, volume 266 of Lect. Notes in Comput. Sci., pages 196–223. Springer Verlag, 1987.

    Google Scholar 

  39. J. Padberg. Abstract Petri nets: Uniform approach and rule-based refinement. PhD thesis, Technische Universität Berlin, 1996.

    Google Scholar 

  40. J. Padberg. Classification of Petri nets using adjoint functors. In EATCS Bulletin, volume 66, pages 85–91. European Association for Theoretical Computer Science, 1998.

    Google Scholar 

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

    Google Scholar 

  42. K. Reinhardt. Reachability in Petri nets with inhibitor arcs. Technical Report WSI-96-30, Wilhelm Schickard Institut für Informatik, Universität Tübingen, 1996.

    Google Scholar 

  43. W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.

    Google Scholar 

  44. G. Ristori. Modelling Systems with Shared Resources via Petri Nets. PhD thesis, Computer Science Department, University of Pisa, 1994. Published as Technical Report TD-5/94.

    Google Scholar 

  45. V. Sassone. An axiomatization of the algebra of Petri net concatenable processes. Theoret. Comput. Sci., 170(1–2):277–296, 1996.

    MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  47. I. Suzuki and T. Murata. A method for stepwise refinement and abstraction of Petri nets. J. Comput. and System Sci., 27:51–76, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  48. R. Valette. Analysis of Petri nets by stepwise refinement. J. Comput. and System Sci., 18:35–46, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  49. W. Vogler. Behaviour preserving refinements of Petri nets. In G. Tinhofer and G. Schmidt, editors, Proceedings 12th International Workshop on Graph-Theoretic Concepts in Computer Science, volume 246 of Lect. Notes in Comput. Sci., pages 82–93. Springer Verlag, 1987.

    Google Scholar 

  50. G. Winskel. Event structure semantics of CCS and related languages. In M. Nielsen and E. Meineche Schmidt, editors, Proceedings ICALP’82, volume 140 of Lect. Notes in Comput. Sci., pages 561–567. Springer Verlag, 1982.

    Google Scholar 

  51. G. Winskel. Event structures. In W. Brauer, editor, Proceedings Advanced Course on Petri Nets, volume 255 of Lect. Notes in Comput. Sci., pages 325–392. Springer Verlag, 1987.

    Google Scholar 

  52. G. Winskel. Petri nets, algebras, morphisms and compositionality. Inform. and Comput., 72:197–238, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Universitá di Pisa, Italia

    Roberto Bruni & Ugo Montanari

Authors
  1. Roberto Bruni
    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

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig  & Julia Padberg  & 

  2. Katholische Universität Eichstätt, Ostenstr. 28, 85072, Eichstätt, Germany

    Gabriel Juhás

  3. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bruni, R., Montanari, U. (2001). Transactions and Zero-Safe Nets. In: Ehrig, H., Padberg, J., Juhás, G., Rozenberg, G. (eds) Unifying Petri Nets. Lecture Notes in Computer Science, vol 2128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45541-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45541-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation