A Reachability Algorithm for General Petri Nets Based on Transition Invariants

DOI10.1007/11821069_53MaRDI QIDQ5756691zbMATH OpenOpenAlexFDO

Authors Alexander Kostin

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_53

zbMATH Keywords

Petri netsreachabilitytransition invariants

Mathematics Subject Classification ID

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

Recommendations

• An Algorithm for the General Petri Net Reachability Problem
• Compositional reachability in Petri nets
• Reachability in cyclic extended free-choice systems
• Hierarchical reachability graph generation for Petri nets
• scientific article; zbMATH DE number 2112159

Cited in

(10)

• S-invariant analysis of general recursive Petri boxes
• Dominance and T-Invariants for Petri Nets and Chemical Reaction Networks
• Compositional reachability in Petri nets
• scientific article; zbMATH DE number 5631271 (Why is no real title available?)
• scientific article; zbMATH DE number 4127001 (Why is no real title available?)
• scientific article; zbMATH DE number 6845563 (Why is no real title available?)
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• Topological reverse mirroring: a new efficient knowledge-based methodology of reachability analysis for Petri nets
• On the Approximation of the Resource Equivalences in Petri Nets with the Invisible Transitions
• Optimization-based computation of bounded sequences to reach target states in DESs

Describes a project that uses

Uses Software

• GreatSPN
• GreatSPN 1.7
• TimeNET

This page was built for publication: A Reachability Algorithm for General Petri Nets Based on Transition Invariants

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