On the reversibility of well-behaved weighted choice-free systems
DOI10.1007/978-3-319-07734-5_18zbMATH Open1410.68251OpenAlexW175714733MaRDI QIDQ5166772FDOQ5166772
Authors: Thomas Hujsa, Jean-Marc Delosme, Alix Munier-Kordon 
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
Recommendations
decompositionreversibilitywell-behavednesspolynomial conditionsT-systemweighted Petri netsfork-attributionchoice-free systemplace-splitting transformation
Cites Work
- Structure theory of equal conflict systems
- A sufficient condition for the liveness of weighted event graphs
- Termination Properties of Generalized Petri Nets
- Title not available (Why is that?)
- Structural properties of petri nets
- Decomposition Theorems for Bounded Persistent Petri Nets
- Petri net distributability
- On the reversibility of well-behaved weighted choice-free systems
Cited In (10)
- 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
- Title not available (Why is that?)
- STP-based judgment method of reversibility and liveness of bounded Petri nets
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
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)
