Reversing Steps in Petri Nets

DOI10.1007/978-3-030-21571-2_11OpenAlexW2951300572WikidataQ104379635 ScholiaQ104379635MaRDI QIDQ6144213

David de Frutos-Escrig, Maciej Koutny, Łukasz Mikulski

Publication date: 29 January 2024

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://eprints.ucm.es/id/eprint/62987/1/Frutos53.pdf

zbMATH Keywords

Petri netreversible computationstep semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures ⋮ Unnamed Item ⋮ Acyclic and Cyclic Reversing Computations in Petri Nets ⋮ Investigating Reversibility of Steps in Petri Nets

Cites Work

• Unnamed Item
• Reversibility and asymmetric conflict in event structures
• An efficient characterization of Petri net solvable binary words
• Reversing algebraic process calculi
• General Reversibility
• On the Reversibility of Live Equal-Conflict Petri Nets
• 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