A unified model checking framework for the supervisor synthesis problem

Abstract. The supervisor synthesis problem asks whether one can restrict the behavior of a reactive system such that it satisfies a given specification. As it is more general, this problem is harder than the verification problem. Several approaches based on different logics have been developed to tackle the supervisor synthesis problem. In this paper, we show that the most prominent logics, namely alternating time μ-calculus and extensions of the Ramadge-Wonham framework, can be reduced to the model checking problem of the propositional μ-calculus. As a result, our algorithms may be used as a frontend on top of existing modelchecking tools like Averest.