Partial order behaviour and structure of Petri nets

DOI10.1007/BF01888220zbMath0697.68061MaRDI QIDQ911779

Eike Best, Jörg Desel

Publication date: 1990

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

true concurrencypartial ordersfree choice Petri nets

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (7)

Regular marked Petri nets ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ Complexity results for 1-safe nets ⋮ A polynomial-time algorithm to decide liveness of bounded free choice nets ⋮ Traps characterize home states in free choice systems ⋮ Reachability in cyclic extended free-choice systems ⋮ Compositional generation of home states in free choice nets

Cites Work

• Modeling concurrency with partial orders
• Sequential and concurrent behaviour in Petri net theory
• The non-sequential behaviour of Petri nets
• A fresh look at free choice nets
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial order behaviour and structure of Petri nets