Synthesis of Infinite State Systems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917541107990528 |
|---|---|
| author | Drucker, Ohad Rabinovich, Alexander |
| author_facet | Drucker, Ohad Rabinovich, Alexander |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_08713 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Synthesis of Infinite State Systems Drucker, Ohad Rabinovich, Alexander Logic in Computer Science 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. |
| title | Synthesis of Infinite State Systems |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2501.08713 |