Acyclic and cyclic reversing computations in Petri nets
From MaRDI portal
Publication:5862345
DOI10.3233/FI-2021-2099OpenAlexW3188932320MaRDI QIDQ5862345FDOQ5862345
Authors: Kamila Barylska, Anna Gogolinska 
Publication date: 9 March 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.02167
Recommendations
Cites Work
- Understanding Petri Nets
- Coloured Petri Nets
- Title not available (Why is that?)
- Reverse code generation for parallel discrete event simulation
- Title not available (Why is that?)
- Traps characterize home states in free choice systems
- Petri net reachability graphs: decidability status of FO properties
- Reversible computation in Petri nets
- Reversing transitions in bounded Petri nets
- Reversing Unbounded Petri Nets
- An efficient characterization of Petri net solvable binary words
- Reversing Steps in Petri Nets
Cited In (6)
- Reversible computation in nets with bonds
- Reversing transitions in bounded Petri nets
- Investigating reversibility of steps in Petri nets
- Encoding reversing Petri nets in answer set programming
- Reversible computation in Petri nets
- Token multiplicity in reversing Petri nets under the individual token interpretation
Uses Software
This page was built for publication: Acyclic and cyclic reversing computations in Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862345)
