### Skapa referens, olika format (klipp och klistra)

**Harvard**

Miremadi, S., Lennartson, B. och Åkesson, K. (2011) *BDD-based supervisory control on extended finite automata*.

** BibTeX **

@conference{

Miremadi2011,

author={Miremadi, Sajed and Lennartson, Bengt and Åkesson, Knut},

title={BDD-based supervisory control on extended finite automata},

booktitle={2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011; Trieste; 24 August 2011 through 27 August 2011},

isbn={978-145771730-7},

pages={25-31 },

abstract={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.},

year={2011},

keywords={binary decision diagrams, extended finite automata, supervisor representation, Supervisory control theory, symbolic representation},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 150976

A1 Miremadi, Sajed

A1 Lennartson, Bengt

A1 Åkesson, Knut

T1 BDD-based supervisory control on extended finite automata

YR 2011

T2 2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011; Trieste; 24 August 2011 through 27 August 2011

SN 978-145771730-7

SP 25

OP 31

AB 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.

LA eng

DO 10.1109/CASE.2011.6042480

LK http://dx.doi.org/10.1109/CASE.2011.6042480

LK http://publications.lib.chalmers.se/records/fulltext/150976/local_150976.pdf

OL 30