Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

Abstract

. (2010). Model abstraction of nondeterministic finite-state automata in supervisor synthesis. IEEE Transactions on Automatic Control, 55(11), 2527-2541. DOI: 10.1109/TAC.2010 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research.• You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Abstract-Blockingness is one of the major obstacles that need to be overcome in the Ramadge-Wonham supervisory synthesis paradigm, especially for large systems. In this paper, we propose an abstraction technique to overcome this difficulty. We first provide details of this abstraction technique, then describe how it can be applied to a supervisor synthesis problem, where plant models are nondeterministic but specifications and supervisors are deterministic. We show that a nonblocking supervisor for an abstraction of a plant under a specification is guaranteed to be a nonblocking supervisor of the original plant under the same specification. The reverse statement is also true, if we impose an additional constraint in the choice of the alphabet of abstraction, i.e., every event, which is either observable or labels a transition to a marker state, is contained in the alphabet of abstraction.Index Terms-Automaton abstraction, discrete-event systems, nondeterministic finite-state automata, supervisor synthesis.

Employing behavioral preorders to define controllability for nondeterministic discrete-event systems

“…However, such a minimization is not the coarsest minimization possible with respect to the notion of controllability employed. Plant or supervisor abstraction (Flordal et al 2007;Su et al 2010;Schmidt and Cury 2012;Mohajerani et al 2012) are related techniques for (supervised) plant minimization that aim to optimize the synthesis procedure, typically employed in compositional, modular, or hierarchical synthesis. The former technique abstracts away local events during compositional synthesis that no longer play a role in the synthesis procedure and cannot ruin controllability.…”

Application of supervisory control theory to theme park vehicles

“…To achieve a nonblocking supervisor S 2 , an abstraction W 1 of G 1 × S 1 is created. The abstraction process is essentially a quotient construction modulo the weak observation equivalence relation defined in Su et al (2010b), which has the property that an automaton that is nonconflicting with an abstracted model is guaranteed to be nonconflicting with the original model. This important property ensures that supervisor synthesis can be done based on an abstracted model, which is usually much simpler than the original model.…”

Modeling and Optimal Supervision of Multi Sensors and Multi-States Discrete-Event Systems with Structured Languages

“…Jayasiri and Mann [18] use supervisory control of fuzzy discrete event systems to control mobile robotics; Yao [19] uses infinitesimal perturbation analysis of stochastic flow models to analyze DES; Su [20] presents an abstract way to model the nondeterministic finite-state automata in DES. Chen, Kuo and Chen [21] present the modeling of hierarchical robotic discrete-event system.…”