J. Allen (1983):
Maintaining Knowledge about Temporal Intervals.
Communications of the ACM 26(11),
pp. 832–843,
doi:10.1145/182.358434.
J. R. Büchi & L. H. Landweber (1990):
Solving Sequential Conditions by Finite-State Strategies.
In: S. Mac Lane & D. Siefkes: The Collected Works of J. R. Büchi.
Springer New York,
pp. 525–541,
doi:10.2307/1994916.
A. Church (1957):
Applications of recursive arithmetic to the problem of circuit synthesis.
In: Summaries of the Summer Institute of Symbolic Logic, Volume I.
Cornell Univ., Ithaca, N.Y.,
pp. 3–50,
doi:10.2307/2271310.
T. French, J. C. McCabe-Dansted & M. Reynolds (2012):
Synthesis for Temporal Logic over the Reals.
In: Proc. of the 9th AiML,
pp. 217–238.
J. Halpern & Y. Shoham (1991):
A propositional modal logic of time intervals.
Journal of the ACM 38(4),
pp. 935–962,
doi:10.1145/115234.115351.
Z. Manna & P. Wolper (1984):
Synthesis of Communicating Processes from Temporal Logic Specifications.
ACM Transactions on Programming Languages and Systems 6(1),
pp. 68–93,
doi:10.1145/357233.357237.
M. L. Minsky (1967):
Computation: Finite and Infinite Machines.
Prentice-Hall, Inc.,
NJ, USA.
A. Montanari, G. Puppis & P. Sala (2010):
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals.
In: Proc. of the 37th ICALP - Part II,
LNCS 6199,
pp. 345–356,
doi:10.1007/978-3-642-14162-1_29.
A. Montanari, G. Puppis, P. Sala & G. Sciavicco (2010):
Decidability of the Interval Temporal Logic ABbar016B on Natural Numbers.
In: Proc. of the 27th STACS,
pp. 597–608,
doi:10.4230/LIPIcs.STACS.2010.2488.
A. Montanari & P. Sala (2013):
Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness.
In: Proc. of the 28th LICS.
IEEE,
pp. 193–202,
doi:10.1109/LICS.2013.25.
A. Pnueli & R. Rosner (1989):
On the Synthesis of a Reactive Module.
In: Proc. of the 16th POPL.
ACM Press,
pp. 179–190,
doi:10.1145/75277.75293.
A. Rabinovich (2007):
The Church Synthesis Problem with Parameters.
Logical Methods in Computer Science 3(4),
doi:10.2168/lmcs-3(4:9)2007.
A. Rabinovich & W. Thomas:
Logical refinements of ChurchÕs Problem.
In: Proc. of the 21st CSL,
LNCS 4646.
Springer,
pp. 69–83,
doi:10.1007/978-3-540-74915-8_9.
P. Schnoebelen (2010):
Lossy Counter Machines Decidability Cheat Sheet.
In: A. Kucera & I. Potapov: Reachability Problems,
LNCS 6227.
Springer,
pp. 51–75,
doi:10.1007/978-3-642-15349-5_4.
Y. Venema (1991):
A modal logic for chopping intervals.
Journal of Logic and Computation 1(4),
pp. 453–476,
doi:10.1093/logcom/1.4.453.
eptcs@eptcs.org