@inproceedings{https___doi.org_10.4230_lipics.stacs.2026.64,
    doi = {10.4230/lipics.stacs.2026.64},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.64},
    author = {Lasota, Sławomir and Lehaut, Mathieu and Parreaux, Julie and Piórkowski, Radosław},
    keywords = {timed automata, register automata, Büchi-Landweber games, Church synthesis problem, reactive synthesis problem, Theory of computation → Timed and hybrid models, Theory of computation → Automata over infinite objects, Theory of computation → Quantitative automata, Theory of computation → Logic and verification},
    language = {en},
    title = {One-Clock Synthesis Problems},
    journal = {LIPIcs, Volume 364, STACS 2026},
    volume = {364},
    pages = {64:1-64:21},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2026},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2026-3-2 7:54:3 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.stacs.2026.64, doi = {10.4230/lipics.stacs.2026.64}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.64}, author = {Lasota, Sławomir and Lehaut, Mathieu and Parreaux, Julie and Piórkowski, Radosław}, keywords = {timed automata, register automata, Büchi-Landweber games, Church synthesis problem, reactive synthesis problem, Theory of computation → Timed and hybrid models, Theory of computation → Automata over infinite objects, Theory of computation → Quantitative automata, Theory of computation → Logic and verification}, language = {en}, title = {One-Clock Synthesis Problems}, journal = {LIPIcs, Volume 364, STACS 2026}, volume = {364}, pages = {64:1-64:21}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2026}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2026-3-2 7:54:3 +0100} }