Reachability analysis in T-invariant-less petri nets

DOI10.1109/TAC.2003.812788MaRDI QIDQ5266827zbMATH OpenFDO

Authors Alexander Kostin

Publication date 20 June 2017

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

Full work available at URL https://doi.org/10.1109/TAC.2003.812788

Mathematics Subject Classification ID

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

Cited in

(12)

• S-invariant analysis of general recursive Petri boxes
• A lazy query scheme for reachability analysis in Petri nets
• The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets
• Dominance and T-Invariants for Petri Nets and Chemical Reaction Networks
• scientific article; zbMATH DE number 4213468 (Why is no real title available?)
• scientific article; zbMATH DE number 5631271 (Why is no real title available?)
• scientific article; zbMATH DE number 4127001 (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
• Recursive solution of number of reachable states of a simple subclass of FMS
• Reachability determination in acyclic Petri nets by cell enumeration approach
• Optimization-based computation of bounded sequences to reach target states in DESs

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

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