SwePub
Sök i LIBRIS databas

  Extended search

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

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

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Fei, Zhennan,1984Chalmers tekniska högskola,Chalmers University of Technology (author)

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

  • Article/chapterEnglish2011

Publisher, publication year, extent ...

  • 2011
  • electronicrdacarrier

Numbers

  • LIBRIS-ID:oai:research.chalmers.se:4d5a60bb-3005-45df-a208-eac778fbd7a8
  • ISBN:9789898425409
  • https://research.chalmers.se/publication/128814URI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:kon swepub-publicationtype
  • Subject category:ref swepub-contenttype

Notes

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

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Miremadi, Sajed,1983Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)miremads (author)
  • Åkesson, Knut,1972Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)knut (author)
  • Lennartson, Bengt,1956Chalmers tekniska högskola,Chalmers University of Technology(Swepub:cth)l (author)
  • Chalmers tekniska högskola (creator_code:org_t)

Related titles

  • In:ICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence1, s. 106-1159789898425409

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside 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 Close

Copy and save the link in order to return to this view