Recursive solution of number of reachable states of a simple subclass of FMS

DOI10.1080/00207721.2012.745240zbMath1307.93250OpenAlexW2150881274MaRDI QIDQ5172599

Daniel Yuh Chao

Publication date: 4 February 2015

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207721.2012.745240

zbMATH Keywords

flexible manufacturing systemsreachabilityPetri netsS\(^{3}\)PR

Mathematics Subject Classification ID

Production models (90B30) Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Related Items (3)

Topological reverse mirroring: a new efficient knowledge-based methodology of reachability analysis for 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 ⋮ Necessary and sufficient liveness condition of GS³PR Petri nets

Uses Software

• INA

Cites Work

• Modelling the protocol stack in NCS with deterministic and stochastic petri net
• Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming
• Feedback control designs for manufacturing systems modelled by continuous Petri nets
• Reachability analysis in T-invariant-less petri nets

This page was built for publication: Recursive solution of number of reachable states of a simple subclass of FMS