Reversing Unbounded Petri Nets

DOI10.1007/978-3-030-21571-2_13OpenAlexW2953309120WikidataQ104379641 ScholiaQ104379641MaRDI QIDQ6144215

Ivan Lanese, Ł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://doi.org/10.1007/978-3-030-21571-2_13

zbMATH Keywords

Petri netsreversibilityreverse transition

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item ⋮ Formal translation from reversing Petri nets to coloured Petri nets ⋮ Acyclic and Cyclic Reversing Computations in Petri Nets ⋮ Investigating Reversibility of Steps in Petri Nets

Cites Work

• Unnamed Item
• Unnamed Item
• Existence of home states in Petri nets is decidable
• Undecidability of bisimilarity for Petri nets and some related problems
• Petri net synthesis
• A theory of reversibility for Erlang
• Crocodile: A Symbolic/Symbolic Tool for the Analysis of Symmetric Nets with Bag
• Controlling Reversibility in Higher-Order Pi
• Vector Addition System Reversible Reachability Problem
• Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions
• Irreversibility and Heat Generation in the Computing Process
• Reversing Transitions in Bounded Petri Nets
• CONCUR 2004 - Concurrency Theory
• Bounded Algol-Like Languages
• Logical Reversibility of Computation