Skip to main content

On Condition/Event Representations of Place/Transition Systems

  • Chapter
Concurrency and Nets

Abstract

One of the fundamental principles in Net Theory is that each representation of a system as a marked net should be traced back to a common basic interpretation — nets of conditions and events ([Pe]). However, this immediately implies a number of questions.

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

Access this chapter

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. E. Best: “In Quest of a Morphism”, Petri Net Newsletter 18, October 1984

    Google Scholar 

  2. P. Degano, U. Montanari: “A Model for Distributed Systems Based on Graph Rewriting”, report 111, consiglio nazionale delle ricerche, progetto finalizzato informatica, Cnet, Nov. 1983

    Google Scholar 

  3. R. Durchholz: “A Note on Multiplicity”, Petri Net Newsletter 21, June 1985

    Google Scholar 

  4. H.J. Genrich: “Projections of C/E systems”, in: Advances in Petri Nets 1985, LNCS 222, Springer-Verlag, 1986

    Google Scholar 

  5. U. Goltz: “Considering Nets as Distributed Transition Systems”, Petri Net Newsletter 21, June 1985

    Google Scholar 

  6. U. Goltz: “Building Structured Petri Nets”, Arbeitspapiere der GMD 223, October 1986

    Google Scholar 

  7. U. Goltz:“How Many Transitions may be in Conflict?”, Petri Net Newsletter 25, Dec. 1986

    Google Scholar 

  8. U. Goltz, W. Reisig: “The Non-sequential Behaviour of Petri Nets”, Information and Control, Vol 57, Nos. 2–3, May/June 1983

    Google Scholar 

  9. P.E. Lauer, M.W. Shields, E. Best: “Formal Theory of the Basic COSY Notation”, Computing Laboratory, University of Newcastle upon Tyne, Technical report No. 143, November 1979

    Google Scholar 

  10. D. Park: “Concurrency and Automata on Infinite Sequences”, Proc. 5th GI Conf. on Theoretical Computer Science, LNCS 104, Springer-Verlag, 1981

    Google Scholar 

  11. C.A. Petri: “Interpretations of Net Theory”, internal report GMD-ISF 75-07, revised version, Bonn 1976

    Google Scholar 

  12. G. Rozenberg, P.S. Thiagarajan: “Petri Nets: Basic Notions, Structure, Behaviour”, in: LNCS 224, Springer-Verlag, 1986

    Google Scholar 

  13. E. Smith, W. Reisig: “The Semantics of a Net is a Net — An Exercise in General Net Theory”, in this volume

    Google Scholar 

  14. K. Voss: “System Specification with Labelled Nets and the Notion of Interface Equivalence”, Arbeitspapiere der GMD 211, June 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Goltz, U. (1987). On Condition/Event Representations of Place/Transition Systems. In: Voss, K., Genrich, H.J., Rozenberg, G. (eds) Concurrency and Nets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72822-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72822-8_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-72824-2

  • Online ISBN: 978-3-642-72822-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics