• C. A. Petri
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 84)


A relation of concurrency can be defined in every occurrence net and every synchronization graph. In some instances, the occurrence net resp. the synchronization graph can be recomputed from the concurrency relation. It has been found that nets which can be constructed from a concurrency relation play an important role in applications. Concurrency structures which define uniquely an occurrence net or an condition-event-system are called "ropes". The properties of binary relations producing ropes are considered to be — all or in part — candidates for axioms of "coexistence", with concurrency as one special instance.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Genrich, H.J. and Stankiewicz-Wiechno, E.: A Dictionary of some basic Notions of Net Theory. In these proceedings (1979)Google Scholar
  2. [2]
    Petri, C.A.: Concurrency as a Basis of Systems Thinking. in: Proc. 5th Scandinavian Logic Symposium. Eds.: F.V.Jensen, B.H.Mayoh, K.K. Möller. Aalborg Universitetsforlag, 1979Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • C. A. Petri
    • 1
  1. 1.GMD BonnGermany

Personalised recommendations