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

An Algorithm for Weak Synthesis Observation Equivalence for Compositional Supervisor Synthesis

Sahar Mohajerani (Institutionen för signaler och system, Automation) ; Robi Malik ; Martin Fabian (Institutionen för signaler och system, Automation)
Proc. 11th International Workshop on Discrete Event Systems (WODES'12) Vol. 239--244 (2012),
[Konferensbidrag, refereegranskat]

This paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be obtained. The paper describes the algorithm, adapted from known bisimulation equivalence algorithms, for the improved abstraction method. The algorithm has been implemented in the DES software tool Supremica and has been used to compute modular supervisors for several large benchmark examples. It successfully computes modular supervisors for systems with more than 10^12 reachable states.

Nyckelord: Automata, Abstrcation, Supervisory control theory

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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2012-11-05. Senast ändrad 2016-02-01.
CPL Pubid: 165507


Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för signaler och system, Automation



Chalmers infrastruktur