Skip to main content
SpringerLink
Log in

Observing partial order runs of Petri Nets

  • Chapter
  • First Online:
Book cover Foundations of Computer Science

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

  • 277 Accesses

Abstract

A reformulation of the standard causal semantics for Petri nets is proposed which allows one to reconstruct a partial order run from sequential observations without any knowledge of the underlying net structure or its current marking. It provides a new solution to how Mazurkiewicz's trace theory can be generalized to unbounded nets.

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. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. Acta Informatica, (28):231–264, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  2. P. Darondeau and P. Degano. Causal trees. In Proceedings of ICALP 89, number 372 in Lecture Notes in Computer Science, pages 234–248, 1989.

    Google Scholar 

  3. P. Degano, R. De Nicola, and U. Montanari. A distributed operational semantics for CCS based on condition/event systems. Acta Informatica, 26:59–91, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  4. V. Diekert. Combinatorics of Traces. number 454 in Ledure Notes in Computer Science, 1990.

    Google Scholar 

  5. U. Goltz and W. Reisig. The non-sequential behaviour of Petri nets. Information and Control, 57(2–3): 125–147, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. W. Hoogers, H. C. M. Kleijn, and P. S. Thiagarajan. A trace semantics for Petri nets. In W. Kuich, editor, Proceedings of ICALP 92, number 623 in Lecture Notes in Computer Science, pages 595–604, 1992.

    Google Scholar 

  7. A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697–718, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Mazurkiewicz. Concurrent program schemes and their interpretation. Report DAIMI PB-78, Aarhus University, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr.21, D-80290, München, Germany

    Astrid Kiehn

Authors
  1. Astrid Kiehn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Freksa Matthias Jantzen Rüdiger Valk

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kiehn, A. (1997). Observing partial order runs of Petri Nets. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052091

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63746-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation