Abstract

. Over the last few years, the automata-theoretic approach to realizability checking and synthesis of reactive modules, developed by Pnueli and Rosner, by Abadi, Lamport, and Wolper, and by Dill and Wong-Toi, has been quite successful, handling both the synchronous and the asynchronous cases. In this approach one transforms the specification into a tree automaton. The specification is realizable if this tree automaton is nonempty, i.e., accepts some infinite tree, and a finite representation of an infinite tree accepted by this automaton can be viewed as a finite-state program realizing the specification. Anuchitanukul and Manna argued that the automata-theoretic approach cannot handle realizability checking and synthesis under fairness assumptions. In this paper we show to the contrary that the automata-theoretic approach can handle realizability checking and synthesis under a variety of fairness assumption. 1 Introduction One of the most significant developments in the area of progr...

Citations

1085	Automatic verification of finite-state concurrent systems using temporal logic specifications - Clarke, Emerson, et al. - 1986
409	L.: The existence of refinement mappings - Abadi, Lamport - 1991
301	On a decision method in restricted second order arithmetic - Buchi - 1962
114	Solving sequential conditions by finite-state strategies - Buchi, Landweber - 1969
112	Verification tools for finite-state concurrent systems - Clarke, Grumberg, et al. - 1994
14	Realizability and synthesis of reactive modules - Anuchitanukul, Manna - 1994
1	Realizable and unrealizable concurrent program specifications - Wolper - 1989