R. Alur & T. A. Henzinger (1998):
Finitary Fairness.
ACM Trans. Program. Lang. Syst. 20(6),
pp. 1171–1194,
doi:10.1145/295656.295659.
D. Barozzini, D. Della Monica, A. Montanari & P. Sala:
Extending ω-regular languages with a strong T-constructor: ωT-regular languages and counter-queue automata.
Research Report 2017/01, Dept. of Mathematics, Computer Science, and Physics, University of Udine, Italy.
M. Bojańczyk (2004):
A bounding quantifier.
In: CSL,
LNCS 3210.
Springer,
pp. 41–55,
doi:10.1007/978-3-540-30124-0_7.
M. Bojańczyk (2011):
Weak MSO with the Unbounding Quantifier.
Theory of Computing Systems 48(3),
pp. 554–576,
doi:10.1007/s00224-010-9279-2.
M. Bojańczyk & T. Colcombet (2006):
Bounds in ω-Regularity.
In: LICS,
pp. 285–296,
doi:10.1109/LICS.2006.17.
M. Bojańczyk, P. Parys & S. Toruńczyk (2016):
The MSO+U Theory of (N, ) Is Undecidable.
In: STACS,
LIPIcs 47,
pp. 21:1–21:8,
doi:10.4230/LIPIcs.STACS.2016.21.
J. R. Büchi (1962):
On a decision method in restricted second order arithmetic.
In: Proc. of the 1960 Int. Congress on Logic, Methodology and Philosophy of Science,
pp. 1–11.
D. Della Monica, A. Montanari, A. Murano & P. Sala (2016):
Prompt Interval Temporal Logic.
In: JELIA,
LNCS 10021.
Springer,
pp. 207–222,
doi:10.1007/978-3-319-48758-8_14.
C. C. Elgot & M. O. Rabin (1966):
Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.
J. Symb. Log. 31(2),
pp. 169–181,
doi:10.1002/malq.19600060105.
S. Hummel & M. Skrzypczak (2012):
The Topological Complexity of MSO+U and Related Automata Models.
Fundam. Inform. 119(1),
pp. 87–111,
doi:10.3233/FI-2012-728.
O. Kupferman, N. Piterman & M. Y. Vardi (2009):
From liveness to promptness.
Formal Methods in System Design 34(2),
pp. 83–103,
doi:10.1007/s10703-009-0067-z.
M. Skrzypczak (2014):
Separation Property for ωB- and ωS-regular Languages.
Logical Methods in Computer Science 10(1),
doi:10.2168/LMCS-10(1:8)2014.
R. McNaughton (1966):
Testing and Generating Infinite Sequences by a Finite Automaton.
Information and Control 9(5),
pp. 521–530,
doi:10.1016/S0019-9958(66)80013-X.
A. Montanari & P. Sala (2013):
Adding an equivalence relation to the interval logic ABB: complexity and expressiveness.
In: LICS.
IEEE Computer Society,
pp. 193–202,
doi:10.1109/LICS.2013.25.
eptcs@eptcs.org