scientific article; zbMATH DE number 1232238

MaRDI QIDQ4223064zbMATH OpenFDO

Authors Zakaria Bouziane, Alain Finkel

Publication date 3 January 1999

zbMATH Keywords

cyclic Petri netreachability sets

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 762060
• A note on the reachability set of Petri nets
• Petri nets and semilinear sets (extended abstract)
• Structurally cyclic Petri nets
• Approximating Petri net reachability along context-free traces
• scientific article; zbMATH DE number 3972197
• On reachability graphs of Petri nets
• A sufficient condition for reachability in a general Petri net
• PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS
• Remarks on the Reachability Graphs of Petri Nets

Cited in

(7)

• Vector Addition System Reversible Reachability Problem
• Investigating reversibility of steps in Petri nets
• Verification of flat FIFO systems
• Verification of population protocols
• Acyclic and cyclic reversing computations in Petri nets
• Verification of Flat FIFO Systems
• The complexity of soundness in workflow nets

This page was built for publication:

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