A Reachability Algorithm for General Petri Nets Based on Transition Invariants

DOI10.1007/11821069_53zbMath1132.68497OpenAlexW1551903405MaRDI 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

reachabilityPetri netstransition invariants

Mathematics Subject Classification ID

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

Related Items (1)

Analyzing Reachability for Some Petri Nets With Fast Growing Markings

Uses Software

• GreatSPN
• TimeNET
• GreatSPN 1.7

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