CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Compositional Synthesis of Discrete Event Systems Using Synthesis Abstraction

Compositional Synthesis of Discrete Event Systems Using Synthesis Abstraction

Sahar Mohajerani (Institutionen för signaler och system, Automation) ; Robi Malik ; Simon Ware ; Martin Fabian (Institutionen för signaler och system, Automation)
The 23rd Chinese Control and Decision Conference (2011)
[Konferensbidrag, refereegranskat]

This paper proposes a general method to synthesize a least restrictive supervisor for a large discrete event system model, consisting of a large number of arbitrary automata representing the plants and specifications. A new type of abstraction called synthesis abstraction is introduced and three rules are proposed to calculate an abstraction of a given automaton. Furthermore, a compositional algorithm for synthesizing a supervisor for large-scale systems of composed finite-state automata is proposed. In the proposed algorithm, the synchronous composition is computed step by step and intermediate results are simplified according to synthesis abstraction. Then a supervisor for the abstracted system is calculated, which in combination with the original system gives the least restrictive, nonblocking, and controllable behaviour.

Nyckelord: Supervisory control theory, automata, state space explosion.

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-04-15. Senast ändrad 2017-09-14.
CPL Pubid: 139184


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Institutioner (Chalmers)

Institutionen för signaler och system, Automation (2005-2017)


Teoretisk datalogi

Chalmers infrastruktur