On the reversibility of well-behaved weighted choice-free systems
From MaRDI portal
Publication:5166772
Recommendations
Cites work
- scientific article; zbMATH DE number 4033100 (Why is no real title available?)
- A sufficient condition for the liveness of weighted event graphs
- Decomposition Theorems for Bounded Persistent Petri Nets
- On the reversibility of well-behaved weighted choice-free systems
- Petri net distributability
- Structural properties of petri nets
- Structure theory of equal conflict systems
- Termination Properties of Generalized Petri Nets
Cited in
(10)- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
- On the reversibility of circular conservative Petri nets
- On liveness and reversibility of equal-conflict Petri nets
- On the Reversibility of Live Equal-Conflict Petri Nets
- On the reversibility of well-behaved weighted choice-free systems
- On deadlockability, liveness and reversibility in subclasses of weighted Petri nets
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- scientific article; zbMATH DE number 176520 (Why is no real title available?)
- STP-based judgment method of reversibility and liveness of bounded Petri nets
This page was built for publication: On the reversibility of well-behaved weighted choice-free systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166772)