Reachability analysis in T-invariant-less petri nets

DOI10.1109/TAC.2003.812788zbMath1364.93501MaRDI QIDQ5266827

Alexander Kostin

Publication date: 20 June 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Controllability (93B05) Control/observation systems involving computers (process control, etc.) (93C83) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Topological reverse mirroring: a new efficient knowledge-based methodology of reachability analysis for Petri nets ⋮ Reachability determination in acyclic Petri nets by cell enumeration approach ⋮ Recursive solution of number of reachable states of a simple subclass of FMS ⋮ The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets ⋮ Analyzing Reachability for Some Petri Nets With Fast Growing Markings

This page was built for publication: Reachability analysis in T-invariant-less petri nets