SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:research.chalmers.se:4d5a60bb-3005-45df-a208-eac778fbd7a8"
 

Sökning: id:"swepub:oai:research.chalmers.se:4d5a60bb-3005-45df-a208-eac778fbd7a8" > Efficient Symbolic ...

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

Fei, Zhennan, 1984 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Miremadi, Sajed, 1983 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Åkesson, Knut, 1972 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
visa fler...
Lennartson, Bengt, 1956 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
visa färre...
 (creator_code:org_t)
ISBN 9789898425409
2011
2011
Engelska.
Ingår i: ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence. - 9789898425409 ; 1, s. 106-115
  • Konferensbidrag (refereegranskat)
Abstract Ämnesord
Stäng  
  • 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.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Systemvetenskap, informationssystem och informatik (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Information Systems (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

symbolic representation
reachability search
deterministic finite automata
propositional formula
Supervisory control theory

Publikations- och innehållstyp

kon (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy