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

**Harvard**

Fei, Z., Miremadi, S., Åkesson, K. och Lennartson, B. (2011) *Efficient Symbolic Supervisory Synthesis and Guard Generation: Evaluating partitioning techniques for the state-space exploration*.

** BibTeX **

@conference{

Fei2011,

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

title={Efficient Symbolic Supervisory Synthesis and Guard Generation: Evaluating partitioning techniques for the state-space exploration},

booktitle={ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence},

isbn={978-989842540-9},

pages={106-115},

abstract={The supervisory control theory (SCT) is a model-based framework, which automatically synthesizes a supervisor that restricts a plant to be controlled based on specifications to be fulfilled. Two main problems, typically encountered in industrial applications, prevent SCT from having a major breakthrough. First, the supervisor which is synthesized automatically from the given plant and specification models might be incomprehensible to the users. To tackle this problem, an approach was recently presented to extract compact propositional formulae (guards) from the supervisor, represented symbolically by binary decision diagrams (BDD). These guards are then attached to the original models, which results in a modular and comprehensible representation of the supervisor. However, this approach, which computes the supervisor symbolically in the conjunctive way, might lead to another problem: the state-space explosion, because of the large number of intermediate BDD nodes during computation. To alleviate this problem, we introduce in this paper an alternative approach that is based on the disjunctive partitioning technique, including a set of selection heuristics. Then this approach is adapted to the guard generation procedure. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples.},

year={2011},

keywords={Supervisory control theory, deterministic finite automata, symbolic representation, reachability search, propositional formula},

}

** RefWorks **

RT Conference Proceedings

SR Electronic

ID 128814

A1 Fei, Zhennan

A1 Miremadi, Sajed

A1 Åkesson, Knut

A1 Lennartson, Bengt

T1 Efficient Symbolic Supervisory Synthesis and Guard Generation: Evaluating partitioning techniques for the state-space exploration

YR 2011

T2 ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence

SN 978-989842540-9

SP 106

OP 115

AB The supervisory control theory (SCT) is a model-based framework, which automatically synthesizes a supervisor that restricts a plant to be controlled based on specifications to be fulfilled. Two main problems, typically encountered in industrial applications, prevent SCT from having a major breakthrough. First, the supervisor which is synthesized automatically from the given plant and specification models might be incomprehensible to the users. To tackle this problem, an approach was recently presented to extract compact propositional formulae (guards) from the supervisor, represented symbolically by binary decision diagrams (BDD). These guards are then attached to the original models, which results in a modular and comprehensible representation of the supervisor. However, this approach, which computes the supervisor symbolically in the conjunctive way, might lead to another problem: the state-space explosion, because of the large number of intermediate BDD nodes during computation. To alleviate this problem, we introduce in this paper an alternative approach that is based on the disjunctive partitioning technique, including a set of selection heuristics. Then this approach is adapted to the guard generation procedure. Finally, the efficiency of the presented approach is demonstrated on a set of benchmark examples.

LA eng

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

OL 30