Nonblocking and Safe Control of Discrete-Event Systems Modeled as Extended Finite Automata
Artikel i vetenskaplig tidskrift, 2011

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. 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. We illustrate our algorithm via a simple manufacturing example.

Automata

Complexity theory

Computational modeling

Data structures

Supervisory control

Discrete event systems

Författare

Lucien Ouedraogo

Ratnesh Kumar

Robi Malik

Knut Åkesson

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

IEEE Transactions on Automation Science and Engineering

1545-5955 (ISSN)

Vol. 8 3 1545-5955

Ämneskategorier

Produktionsteknik, arbetsvetenskap och ergonomi

Reglerteknik

Styrkeområden

Produktion

DOI

10.1109/TASE.2011.2124457