Skip to main content
SpringerLink
Log in

Executing Transactions in Zero-Safe Nets

  • Conference paper
  • First Online:
Application and Theory of Petri Nets 2000 (ICATPN 2000)

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

Included in the following conference series:

Abstract

Distributed systems are often composed by many heterogeneous agents that can work concurrently and exchange information. Therefore, in their modeling via PT nets we must be aware that the basic activities of each system can vary in duration and can be constituted by smaller internal activities, i.e., transitions are conceptually refined into transactions. We address the issue of modeling transactions in distributed systems by using zero-safe nets, which extend PT nets with a simple mechanism for transition synchronization. In particular, starting from the zero-safe net that represents a certain system, we give a distributed algorithm for executing the transactions of the system as transitions of a more abstract PT net. Among the advantages of our approach, we emphasize that the zero-safe net can be much smaller than its abstract counterpart, due to the synchronization mechanism.

Research supported by CNR Integrated Project Progettazione e Verifica di Sistemi Eterogenei Connessi mediante Reti; by Esprit Working Groups CONFER2 and COORDINA; and by MURST projects Tecniche Formali per Sistemi Software and TOSCA: Tipi, Ordine Superiore e Concorrenza.

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

Access this chapter

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

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. E. Best and R. Devillers. Sequential and concurrent behaviour in Petri net theory. Theoret. Comput. Sci., 55:87–136, 1987.

    Article  MathSciNet  Google Scholar 

  4. E. Best, R. Devillers, and J. Esparza. General refinement and recursion for the Petri Box calculus. In Proceedings STACS’93, volume 665 of Lect. Notes in Comput. Sci., pages 130–140. Springer-Verlag, 1993.

    Google Scholar 

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

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

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

  11. R. Bruni and U. Montanari. Zero-safe nets: The individual token approach. In F. Parisi-Presicce, editor, Proceedings 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 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

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

    Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

  23. W. Reisig. Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.

    Google Scholar 

  24. 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  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

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

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. Department of Computer Science, University of Aarhus, Ny Munkegade bldg 540, 8000, Aarhus C, Denmark

    Mogens Nielsen

  2. University of Brighton, Watts Building Lewes Road, Brighton, East Sussex, BN2 4GJ, UK

    Dan Simpson

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruni, R., Montanari, U. (2000). Executing Transactions in Zero-Safe Nets. In: Nielsen, M., Simpson, D. (eds) Application and Theory of Petri Nets 2000. ICATPN 2000. Lecture Notes in Computer Science, vol 1825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44988-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44988-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67693-5

  • Online ISBN: 978-3-540-44988-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation