Symbolic approach to nonblocking and safe control of extended Finite Automata
Paper i proceeding, 2010

For Discrete Event Systems (DES) modeled as Finite Automata, supervisory control theory has been extensively studied. Extended Finite Automata (EFA), i.e., finite automata extended with variables, are a suitable modeling framework for discrete event systems owing to their compactness, resulting from the use of variables. In this paper, we propose a symbolic algorithm that efficiently synthesizes a supervisor for a plant modeled by an EFA and a specification defined by another EFA, or equivalently a set of forbidden locations in the plant EFA. The principle of the algorithm is to iteratively strengthen the guards of the plant EFA so that forbidden or blocking states become unreachable in the controlled plant. As a consequence of the algorithm, the controlled behavior is modeled by an EFA having the same structure as the plant EFA, having stronger guards and is shown to be maximally permissive. © 2010 IEEE.

Författare

L. Ouedraogo

Iowa State University

R. Kumar

Iowa State University

R. Malik

University of Waikato

Knut Åkesson

Chalmers, Signaler och system, System- och reglerteknik, Automation

2010 IEEE International Conference on Automation Science and Engineering, CASE 2010

471-476

Ämneskategorier

Data- och informationsvetenskap

Styrkeområden

Produktion

DOI

10.1109/COASE.2010.5584659

ISBN

978-142445447-1

Mer information

Skapat

2017-10-07