An algorithm for weak synthesis observation equivalence for compositional supervisor synthesis

Abstract

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 made. The paper describes the algorithm, adapted from known bisimulation equivalence… (More)
DOI: 10.3182/20121003-3-MX-4033.00040

Topics

3 Figures and Tables

Slides referencing similar topics