Investigating Reversibility of Steps in Petri Nets
From MaRDI portal
Publication:5025059
DOI10.3233/FI-2021-2082OpenAlexW4207079264MaRDI QIDQ5025059
Łukasz Mikulski, Maciej Koutny, David de Frutos-Escrig
Publication date: 1 February 2022
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.10535
Petri netreversible computationstep semanticsnet synthesisaction splittingdirect reversibilitymixed reversibilityweighted activator arcs
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversibility and asymmetric conflict in event structures
- Reversible computation in Petri nets
- An efficient characterization of Petri net solvable binary words
- Reversing algebraic process calculi
- General Reversibility
- On the Reversibility of Live Equal-Conflict Petri Nets
- Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag
- Reversible Computing
- Reversing Higher-Order Pi
- Reversing Transitions in Bounded Petri Nets
- Understanding Petri Nets
- Conditions for Petri Net Solvable Binary Words
- CONCUR 2004 - Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- Synthesis of Nets with Step Firing Policies
- Reversing Steps in Petri Nets
- Reversing Unbounded Petri Nets
This page was built for publication: Investigating Reversibility of Steps in Petri Nets