A Reachability Algorithm for General Petri Nets Based on Transition Invariants

DOI10.1007/11821069_53zbMath1132.68497MaRDI QIDQ5756691

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

reachability; Petri nets; transition invariants

Mathematics Subject Classification ID

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

Related Items

Analyzing Reachability for Some Petri Nets With Fast Growing Markings

Uses Software

• GreatSPN
• TimeNET
• GreatSPN 1.7