Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller

DOI10.1080/00207179.2014.991940zbMath1337.93003OpenAlexW2082437273MaRDI QIDQ2797617

Daniel Yuh Chao, Gaiyun Liu

Publication date: 5 April 2016

Published in: International Journal of Control (Search for Journal in Brave)

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

zbMATH Keywords

Petri netflexible manufacturing systemdeadlocksiphoninteger linear programming problem

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30) Hierarchical systems (93A13) Discrete event control/observation systems (93C65)

Related Items (2)

Robust deadlock control of automated manufacturing systems with multiple unreliable resources ⋮ The fundamental closed-form solution of control-related states ofkth order S3PR system with left-side non-sharing resource places of Petri nets

Cites Work

• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• A merging method for the siphon-based FMS maximally permissive controllers with simpler structures

This page was built for publication: Further reduction of minimal first-met bad markings for the computationally efficient synthesis of a maximally permissive controller