Partial order behaviour and structure of Petri nets
From MaRDI portal
Publication:911779
DOI10.1007/BF01888220zbMATH Open0697.68061MaRDI QIDQ911779FDOQ911779
Authors: Eike Best, Jörg Desel
Publication date: 1990
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Recommendations
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)
Cites Work
Cited In (24)
- Modular construction and partial order semantics of Petri nets
- Title not available (Why is that?)
- Traps characterize home states in free choice systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- MSO logic and the partial order semantics of place/transition-nets
- Canonizable partial order generators
- Hasse diagram generators and Petri nets
- Adjunct partial array token Petri net structure
- Hasse Diagram Generators and Petri Nets
- Executions: A new partial-order semantics of Petri nets
- Title not available (Why is that?)
- A partial trace semantics for Petri nets
- Complexity results for 1-safe nets
- Partial array token Petri net and \(P\) system
- Untanglings: a novel approach to analyzing concurrent systems
- A polynomial-time algorithm to decide liveness of bounded free choice nets
- Title not available (Why is that?)
- Partial Order Semantics of Types of Nets
- Compositional generation of home states in free choice nets
- Title not available (Why is that?)
- Regular marked Petri nets
- Reachability in cyclic extended free-choice systems
- Weakly UDO semirings and Korczyński nets over them
This page was built for publication: Partial order behaviour and structure of Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911779)