The Church synthesis problem over continuous time

DOI10.46298/LMCS-21(3:8)2025MaRDI QIDQ6925629zbMATH OpenFDO

Authors Alexander Rabinovich, Daniel Fattal

Publication date 25 September 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(3:8)2025

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A theory of timed automata
• Finite variability interpretation of monadic logic of order
• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• On decidability of monadic logic of order over the naturals extended by monadic predicates
• Solving Sequential Conditions by Finite-State Strategies
• The benefits of relaxing punctuality
• The Church synthesis problem with metric
• The monadic theory of order
• Timed Parity Games: Complexity and Robustness
• Uniformization and skolem functions in the class of trees

This page was built for publication: The Church synthesis problem over continuous time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6925629)