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.
Available at http://doi.acm.org/10.1145/377978.377990.
Christel Baier & Joost-Pieter Katoen (2008):
Principles of Model Checking.
The MIT Press.
E. Allen Emerson & Charanjit S. Jutla (1991):
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract).
In: FOCS.
IEEE,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
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,
Lecture Notes in Computer Science 6031.
Springer,
pp. 249–260,
doi:10.1007/978-3-642-13089-2_21.
Available at http://dx.doi.org/10.1007/978-3-642-13089-2.
Marcin Jurdzinski (2000):
Small Progress Measures for Solving Parity Games.
In: Horst Reichel & Sophie Tison: STACS,
Lecture Notes in Computer Science 1770.
Springer,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2009):
From Liveness to Promptness.
Formal Methods in System Design 34(2),
pp. 83–103.
Available at http://dx.doi.org/10.1007/s10703-009-0067-z.
Orna Kupferman & Moshe Y. Vardi (1998):
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time.
In: LICS,
pp. 81–92,
doi:10.1007/s10703-009-0067-z.
Andreas Morgenstern (2010):
Symbolic Controller Synthesis for LTL Specifications.
Department of Computer Science, University of Kaiserslautern, Germany,
Kaiserslautern, Germany.
Andreas Morgenstern & Klaus Schneider (2008):
From LTL to Symbolically Represented Deterministic Automata.
In: Francesco Logozzo, Doron Peled & Lenore D. Zuck: VMCAI,
Lecture Notes in Computer Science 4905.
Springer,
pp. 279–293,
doi:10.1007/978-3-540-78163-9_24.
Andrzej Mostowski (1991):
Games with Forbidden Positions.
Technical Report 78.
University of Gdańsk.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of an Asynchronous Reactive Module.
In: Giorgio Ausiello, Mariangiola Dezani-Ciancaglini & Simona Ronchi Della Rocca: ICALP,
Lecture Notes in Computer Science 372.
Springer,
pp. 652–671,
doi:10.1007/BFb0035790.
A. Prasad Sistla & Edmund M. Clarke (1985):
The Complexity of Propositional Linear Temporal Logics.
J. ACM 32(3),
pp. 733–749.
Available at http://doi.acm.org/10.1145/3828.3837.
eptcs@eptcs.org