Synthesis of Infinite State Systems
Logic in Computer Science
2026-05-29 v2
Abstract
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.
Keywords
Cite
@article{arxiv.2501.08713,
title = {Synthesis of Infinite State Systems},
author = {Ohad Drucker and Alexander Rabinovich},
journal= {arXiv preprint arXiv:2501.08713},
year = {2026}
}