On the reversibility of circular conservative Petri nets

DOI10.1007/978-3-031-33620-1_17zbMATH Open1541.68245MaRDI QIDQ6535198

Raymond Devillers

Publication date: 16 November 2023

zbMATH Keywords

polynomial complexityreversibilityPetri netweighted circuit

Mathematics Subject Classification ID

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

Cites Work

• Existence of home states in Petri nets is decidable
• A diophantine problem of Frobenius in terms of the least common multiple
• Analysis and synthesis of weighted marked graph Petri nets
• An Algorithm for the General Petri Net Reachability Problem
• Termination Properties of Generalized Petri Nets
• Reachability in Petri Nets with Inhibitor Arcs
• The Reachability Problem for Petri Nets Is Not Elementary
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (1)

On the reachability and reversibility problems in a class of 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)