Abstract
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.
Cite
CITATION STYLE
Petri, C. A. (1980). Concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 84 LNCS, pp. 251–260). Springer Verlag. https://doi.org/10.1007/3-540-10001-6_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
