Reachability analysis in T-invariant-less petri nets

DOI10.1109/TAC.2003.812788zbMATH Open1364.93501MaRDI QIDQ5266827FDOQ5266827

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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Control/observation systems involving computers (process control, etc.) (93C83)

Cited In (11)

• The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets
• A lazy query scheme for reachability analysis in Petri nets
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• S-invariant analysis of general recursive Petri boxes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dominance and T-Invariants for Petri Nets and Chemical Reaction Networks
• 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
• Title not available (Why is that?)
• Recursive solution of number of reachable states of a simple subclass of FMS

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)