Rajeev Alur, Kousha Etessami, Salvatore La Torre & Doron Peled (2001):
Parametric Temporal Logic for ``Model Measuring''.
ACM Trans. Comput. Log. 2(3),
pp. 388–407,
doi:10.1145/377978.377990.
Roy Armoni, Limor Fix, Alon Flaisher, Rob Gerth, Boris Ginsburg, Tomer Kanza, Avner Landver, Sela Mador-Haim, Eli Singerman, Andreas Tiemeyer, Moshe Y. Vardi & Yael Zbar (2002):
The ForSpec Temporal Logic: A New Temporal Property-Specification Language.
In: Joost-Pieter Katoen & Perdita Stevens: TACAS,
LNCS 2280.
Springer,
pp. 296–211,
doi:10.1007/3-540-46002-0_21.
J. Richard Büchi & Lawrence H. Landweber (1969):
Solving Sequential Conditions by Finite-State Strategies.
Trans. Amer. Math. Soc. 138,
pp. pp. 295–311,
doi:10.2307/1994916.
C. Eisner & D. Fisman (2006):
A Practical Introduction to PSL.
Integrated Circuits and Systems.
Springer,
doi:10.1007/978-0-387-36123-9.
Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2011):
Antichains and compositional algorithms for LTL synthesis.
Formal Methods in System Design 39(3),
pp. 261–296,
doi:10.1007/s10703-011-0115-3.
Bernd Finkbeiner & Sven Schewe (2013):
Bounded Synthesis.
STTT 15(5-6),
pp. 519–539,
doi:10.1007/s10009-012-0228-z.
Michael J. Fischer & Richard E. Ladner (1979):
Propositional Dynamic Logic of Regular Programs.
Journal of Computer and System Sciences 18(2),
pp. 194 – 211,
doi:10.1016/0022-0000(79)90046-1.
Barbara Di Giampaolo, Salvatore La Torre & Margherita Napoli (2010):
Parametric Metric Interval Temporal Logic.
In: Adrian Horia Dediu, Henning Fernau & Carlos Martín-Vide: LATA,
LNCS 6031.
Springer,
pp. 249–260,
doi:10.1007/978-3-642-13089-2_21.
Hans W. Kamp (1968):
Tense Logic and the Theory of Linear Order.
Computer Science Department, University of California at Los Angeles, USA.
Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2009):
From Liveness to Promptness.
Formal Methods in System Design 34(2),
pp. 83–103,
doi:10.1007/s10703-009-0067-z.
Martin Leucker & César Sánchez (2007):
Regular Linear Temporal Logic.
In: Cliff Jones, Zhiming Liu & Jim Woodcock: ICTAC'07,
LNCS 4711.
Springer-Verlag,
Macau, China,
pp. 291–305,
doi:10.1007/978-3-540-75292-9_20.
Satoru Miyano & Takeshi Hayashi (1984):
Alternating Finite Automata on ω-Words.
Theor. Comput. Sci. 32,
pp. 321–330,
doi:10.1016/0304-3975(84)90049-5.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of an Asynchronous Reactive Module.
In: Giorgio Ausiello, Mariangiola Dezani-Ciancaglini & Simona Ronchi Della Rocca: ICALP,
LNCS 372.
Springer,
pp. 652–671,
doi:10.1007/BFb0035790.
Sven Schewe (2009):
Tighter Bounds for the Determinisation of Büchi Automata.
In: Luca de Alfaro: FOSSACS,
LNCS 5504.
Springer,
pp. 167–181,
doi:10.1007/978-3-642-00596-1_13.
Christoph Schulte Althoff, Wolfgang Thomas & Nico Wallmeier (2006):
Observations on Determinization of Büchi Automata.
Theor. Comput. Sci. 363(2),
pp. 224 – 233,
doi:10.1016/j.tcs.2006.07.026.
A. Prasad Sistla & Edmund M. Clarke (1985):
The Complexity of Propositional Linear Temporal Logics.
J. ACM 32(3),
pp. 733–749,
doi:10.1145/3828.3837.
Ken Thompson (1968):
Programming Techniques: Regular Expression Search Algorithm.
Commun. ACM 11(6),
pp. 419–422,
doi:10.1145/363347.363387.
Moshe Y. Vardi (2011):
The Rise and Fall of LTL.
In: Giovanna D'Agostino & Salvatore La Torre: GandALF,
EPTCS 54,
doi:10.4204/EPTCS.54.
Invited presentation.
Moshe Y. Vardi & Pierre Wolper (1994):
Reasoning About Infinite Computations.
Inf. Comput. 115(1),
pp. 1–37,
doi:10.1006/inco.1994.1092.
Pierre Wolper (1983):
Temporal Logic Can be More Expressive.
Information and Control 56(12),
pp. 72 – 99,
doi:10.1016/S0019-9958(83)80051-5.
Martin Zimmermann (2013):
Optimal Bounds in Parametric LTL Games.
Theor. Comput. Sci. 493,
pp. 30–45,
doi:10.1016/j.tcs.2012.07.039.
eptcs@eptcs.org