Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

DOI10.1109/TAC.2010.2046931zbMath1368.93388OpenAlexW2171773362MaRDI QIDQ4978997

Rong Su, Jacobus E. Rooda, Jan H. van Schuppen

Publication date: 25 August 2017

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

Full work available at URL: https://doi.org/10.1109/tac.2010.2046931

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)

Related Items (10)

Networked supervisor synthesis against lossy channels with bounded network delays as non-networked synthesis ⋮ Application of supervisory control theory to theme park vehicles ⋮ A survey on compositional algorithms for verification and synthesis in supervisory control ⋮ Overview of networked supervisory control with imperfect communication channels ⋮ Bisimilarity enforcing supervisory control of nondeterministic discrete event systems with nondeterministic specifications ⋮ Maximally permissive coordinated distributed supervisory control of nondeterministic discrete-event systems ⋮ Nonconflict check by using sequential automaton abstractions based on weak observation equivalence ⋮ On the stabilization of nondeterministic finite automata via static output feedback ⋮ Coordination control of discrete-event systems revisited ⋮ Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

This page was built for publication: Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis