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

**Harvard**

Miremadi, S., Åkesson, K. och Lennartson, B. (2008) *Extraction and Representation of a Supervisor Using Guards in Extended Finite Automata*.

** BibTeX **

@conference{

Miremadi2008,

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

title={Extraction and Representation of a Supervisor Using Guards in Extended Finite Automata},

booktitle={9th International Workshop on Discrete Event Systems, 2008},

isbn={978-1-4244-2592-1},

pages={193-199},

abstract={In supervisory control theory, an issue that often arises in real industrial applications is the huge number of states for the supervisor, which requires a lot of memory. Another problem that is typically encountered for the users of supervisory synthesis tools is lack of information and unreadability of the supervisor. In this paper, we introduce a method to characterize a controllable and non-blocking supervisor directly on the modular automata (sub-plants and sub-specifications), by extracting some guard conditions from the synthesized supervisor and the synchronized automaton. The presented approach may potentially model a complex supervisor using a compact representation whilst not infringe the original modular structure. Furthermore, the guard conditions, which are generated from a set of states, may give the user of the synthesis procedure a better understanding of which states that were removed during the synthesis. In order to obtain more compact guard expressions, we include some unnecessary states (unreachable and extended forbidden states) in the set of states that will be used for guard generation. By exploiting this extra information, it is possible to reduce the logical expressions to more compact guard conditions.},

year={2008},

keywords={Supervisory control, finite automata, extended finite automata, binary decision diagrams},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 78496

A1 Miremadi, Sajed

A1 Åkesson, Knut

A1 Lennartson, Bengt

T1 Extraction and Representation of a Supervisor Using Guards in Extended Finite Automata

YR 2008

T2 9th International Workshop on Discrete Event Systems, 2008

SN 978-1-4244-2592-1

SP 193

OP 199

AB In supervisory control theory, an issue that often arises in real industrial applications is the huge number of states for the supervisor, which requires a lot of memory. Another problem that is typically encountered for the users of supervisory synthesis tools is lack of information and unreadability of the supervisor. In this paper, we introduce a method to characterize a controllable and non-blocking supervisor directly on the modular automata (sub-plants and sub-specifications), by extracting some guard conditions from the synthesized supervisor and the synchronized automaton. The presented approach may potentially model a complex supervisor using a compact representation whilst not infringe the original modular structure. Furthermore, the guard conditions, which are generated from a set of states, may give the user of the synthesis procedure a better understanding of which states that were removed during the synthesis. In order to obtain more compact guard expressions, we include some unnecessary states (unreachable and extended forbidden states) in the set of states that will be used for guard generation. By exploiting this extra information, it is possible to reduce the logical expressions to more compact guard conditions.

LA eng

LK http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4605944

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

OL 30