BDD-based supervisory control on extended finite automata
Paper i proceeding, 2011

In this paper, we settle some problems that are encountered when modeling and synthesizing complex industrial systems by the supervisory control theory. First, modeling such huge systems with explicit state-transition models typically results in an intractable model. An alternative modeling approach is to use extended finite automata (EFAs), which is an augmentation of ordinary automata with variables. The main advantage of utilizing EFAs for modeling is that more compact models are obtained. The second problem concerns the ease to understand and implement the supervisor. To handle this problem, we represent the supervisor in a modular manner by extending the original EFAs by compact conditional expressions generated from the monolithic supervisor. In order to, potentially, be able to handle complex systems efficiently, the models are symbolically represented by binary decision diagrams (BDDs). All computations that are performed in this framework are based on BDD operations. The framework has been implemented in a supervisory control tool and applied to industrially relevant benchmark problems.

extended finite automata

symbolic representation

binary decision diagrams

Supervisory control theory

supervisor representation

Författare

Sajed Miremadi

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

Bengt Lennartson

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

Knut Åkesson

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

IEEE International Conference on Automation Science and Engineering

21618070 (ISSN) 21618089 (eISSN)

25-31 6042480

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1109/CASE.2011.6042480

ISBN

978-145771730-7

Mer information

Skapat

2017-10-07