Synthesis of Infinite State Systems

The classical Church synthesis problem, solved by Buchi and Landweber treats the synthesis of finite state systems. The synthesis of infinite state systems, on the other hand, has only been investigated few times since then, with no complete or systematic solution. We present a systematic study of the synthesis of infinite state systems. The main step involves the synthesis of MSO-definable parity games, which is, finding MSO-definable uniform memoryless winning strategies for these games. Contributed talk given by Alexander Rabinovich

Authors

• Alexander Rabinovich

Keywords

No keywords are indexed for this paper.