On the reversibility of circular conservative Petri nets

DOI10.1007/978-3-031-33620-1_17MaRDI QIDQ6535198zbMATH OpenFDO

Authors Raymond Devillers

Publication date 16 November 2023

Full work available at URL https://doi.org/10.1007/978-3-031-33620-1_17

zbMATH Keywords

Petri netpolynomial complexityreversibilityweighted circuit

Mathematics Subject Classification ID

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

Recommendations

• Reversing Unbounded Petri Nets
• Reversible computation vs. reversibility in Petri nets
• On the reversibility of well-behaved weighted choice-free systems
• On the Reversibility of Live Equal-Conflict Petri Nets
• Reversing transitions in bounded Petri nets

Cites work

• A diophantine problem of Frobenius in terms of the least common multiple
• An Algorithm for the General Petri Net Reachability Problem
• Analysis and synthesis of weighted marked graph Petri nets
• Existence of home states in Petri nets is decidable
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3471613 (Why is no real title available?)
• scientific article; zbMATH DE number 522844 (Why is no real title available?)
• Reachability in Petri nets with inhibitor arcs
• Termination Properties of Generalized Petri Nets
• The Reachability Problem for Petri Nets Is Not Elementary

Cited in

(3)

• On the Reversibility of Live Equal-Conflict Petri Nets
• On the reachability and reversibility problems in a class of Petri nets
• Reversing Unbounded Petri Nets

This page was built for publication: On the reversibility of circular conservative Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535198)