Skip to main content

Partial order semantics and read arcs

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1997 (MFCS 1997)

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

Abstract

We study a new partial order semantics of Petri nets with read arcs, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled in ordinary nets. As basic observations we take ST-traces, which are sequences of transition starts and ends. We define processes of our nets and derive two partial orders modelling causality and start precedence. These partial orders are related to observations and systems states as in the ordinary approach the single partial order of a process is related to firing sequences and reachable markings. Our approach also supports a new view of concurrency as captured by steps.

Work on this paper was partially supported by the DFG (Project ‘Halbordnungstesten’).

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Busi and R. Gorrieri. A Petri net semantics for π-calculus. In L. Insup and S. Smolka, editors, CONCUR 95, LNCS 962, 145–159. Springer, 1995.

    Google Scholar 

  2. N. Busi and M. Pinna. Non-sequential semantics for contextual P/T-nets. In J. Billington and W. Reisig, editors, Applications and Theory of Petri Nets 1996, LNCS 1091, 113–132. Springer, 1996.

    Google Scholar 

  3. S. Christensen and N.D. Hansen. Coloured Petri nets extended with place capacities, test arcs, and inhibitor arcs. In M. Ajmone-Marsan, editor, Applications and Theory of Petri Nets 1993, LNCS 691, 186–205. Springer, 1993.

    Google Scholar 

  4. P.C. Fishburn. Interval Orders and Interval Graphs. J. Wiley, 1985.

    Google Scholar 

  5. R.J. v. Glabbeek. The refinement theorem for ST-bisimulation semantics. In M. Broy and C.B. Jones, editors, Programming Concepts and Methods, Proc. IFIP Working Conference, 27–52. Elsevier Science Pub. (North-Holland), 1990.

    Google Scholar 

  6. R. Janicki and M. Koutny. Order structures and generalisations of szpilrajn's theorem. In R. Shyamasundar, editor, Found. Software Techn. and Theor. Comp. Sci. '93, LNCS 761, 348–357. Springer, 1993.

    Google Scholar 

  7. R. Janicki and M. Koutny. Semantics of inhibitor nets. Information and Computation, 123:1–16, 1995.

    Article  Google Scholar 

  8. U. Montanari, F. Rossi. Contextual nets. Acta Informatica, 32:545–596, 1995.

    Google Scholar 

  9. W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.

    Google Scholar 

  10. W. Vogler. Timed testing of concurrent systems. Information and Computation, 121:149–171, 1995.

    Article  Google Scholar 

  11. W. Vogler. Efficiency of asynchronous systems and read arcs in Petri nets. To appear in ICALP 97, LNCS. Springer, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1997). Partial order semantics and read arcs. In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029994

Download citation

  • DOI: https://doi.org/10.1007/BFb0029994

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69547-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics