Loading...
Synthesis observation equivalence and weak synthesis observation equivalence
Abstract
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 10¹² reachable states.
Type
Working Paper
Type of thesis
Series
Computer Science Working Papers
Citation
Mohajerani, S., Malik, R. & Fabian, M. (2012). Synthesis observation equivalence and weak synthesis observation equivalence. (Working paper 03/2012). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
Date
2012-07-30
Publisher
University of Waikato, Department of Computer Science
Degree
Supervisors
Rights
© Sahar Mohajerani, Robi Malik, Martin Fabian