On the Reversibility of Well-Behaved Weighted Choice-Free Systems
From MaRDI portal
Publication:5166772
DOI10.1007/978-3-319-07734-5_18zbMath1410.68251MaRDI QIDQ5166772
Thomas Hujsa, Alix Munier Kordon, Jean-Marc Delosme
Publication date: 8 July 2014
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-07734-5_18
decomposition; T-system; reversibility; well-behavedness; polynomial conditions; weighted Petri nets; fork-attribution; choice-free system; place-splitting transformation
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues, On the Reversibility of Well-Behaved Weighted Choice-Free Systems, Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond, Synthesis of Petri nets with restricted place-environments: classical and parameterized, On the Reversibility of Live Equal-Conflict Petri Nets
Cites Work
- Unnamed Item
- Structure theory of equal conflict systems
- A sufficient condition for the liveness of weighted event graphs
- Petri Net Distributability
- Decomposition Theorems for Bounded Persistent Petri Nets
- Termination Properties of Generalized Petri Nets
- Structural properties of petri nets
- On the Reversibility of Well-Behaved Weighted Choice-Free Systems