SYNTHESIS OBSERVATION EQUIVALENCE AND WEAK SYNTHESIS OBSERVATION EQUIVALENCE
Rapport, 2014

This working 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 1012 reachable states.

synthesis

Supervisory control theory

automata

abstraction

Författare

Sahar Mohajerani

Chalmers, Signaler och system, System- och reglerteknik, Automation

Robi Malik

Martin Fabian

Chalmers, Signaler och system, System- och reglerteknik, Automation

Ämneskategorier

Produktionsteknik, arbetsvetenskap och ergonomi

Styrkeområden

Produktion

R - Department of Signals and Systems, Chalmers University of Technology: 1403-266X