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.
Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2009):
Better Quality in Synthesis through Quantitative Objectives.
In: Ahmed Bouajjani & Oded Maler: CAV,
LNCS 5643.
Springer,
pp. 140–156.
Available at http://dx.doi.org/10.1007/978-3-642-02658-4_14.
Mikołaj Bojańczyk (2004):
A Bounding Quantifier.
In: Jerzy Marcinkowski & Andrzej Tarlecki: CSL,
LNCS 3210.
Springer,
pp. 41–55,
doi:10.1007/978-3-540-30124-0_7.
Mikołaj Bojańczyk (2011):
Weak MSO with the Unbounding Quantifier.
Theory Comput. Syst. 48(3),
pp. 554–576,
doi:10.1007/s00224-010-9279-2.
Mikolaj Bojanczyk (2014):
Weak MSO+U with Path Quantifiers over Infinite Trees.
In: Javier Esparza, Pierre Fraigniaud, Thore Husfeldt & Elias Koutsoupias: ICALP (2),
LNCS 8573.
Springer,
pp. 38–49,
doi:10.1007/978-3-662-43951-7_4.
Mikołaj Bojańczyk & Thomas Colcombet (2006):
Bounds in ω-Regularity.
In: LICS.
IEEE Computer Society,
pp. 285–296,
doi:10.1109/LICS.2006.17.
Mikołaj Bojańczyk & Szymon Toruńczyk (2012):
Weak MSO+U over infinite trees.
In: Christoph Dürr & Thomas Wilke: STACS,
LIPIcs 14.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
Dagstuhl, Germany,
pp. 648–660,
doi:10.4230/LIPIcs.STACS.2012.648.
Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera & Petr Novotný (2012):
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.
In: P. Madhusudan & Sanjit A. Seshia: CAV,
LNCS 7358.
Springer,
pp. 23–38,
doi:10.1007/978-3-642-31424-7_8.
Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna & Rohit Singh (2011):
Quantitative Synthesis for Concurrent Programs.
In: Ganesh Gopalakrishnan & Shaz Qadeer: CAV,
LNCS 6806.
Springer,
pp. 243–259,
doi:10.1007/978-3-642-22110-1_20.
Krishnendu Chatterjee & Laurent Doyen (2010):
Energy Parity Games.
In: Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis: ICALP (2),
LNCS 6199.
Springer,
pp. 599–610,
doi:10.1007/978-3-642-14162-1_50.
Krishnendu Chatterjee, Thomas A. Henzinger & Florian Horn (2009):
Finitary winning in omega-regular games.
ACM Trans. Comput. Log. 11(1),
doi:10.1145/1614431.1614432.
Krishnendu Chatterjee, Thomas A. Henzinger & Marcin Jurdziński (2005):
Mean-Payoff Parity Games.
In: LICS.
IEEE Computer Society,
pp. 178–187,
doi:10.1109/LICS.2005.26.
Thomas Colcombet (2009):
The Theory of Stabilisation Monoids and Regular Cost Functions.
In: Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris E. Nikoletseas & Wolfgang Thomas: ICALP (3),
LNCS 5556.
Springer,
pp. 139–150,
doi:10.1007/978-3-642-02930-1_12.
Peter Faymonville & Martin Zimmermann (2014):
Parametric Linear Dynamic Logic.
In: Adriano Peron & Carla Piazza: GandALF,
EPTCS 161,
pp. 60–73,
doi:10.4204/EPTCS.161.8.
Peter Faymonville & Martin Zimmermann (2015):
Parametric Linear Dynamic Logic (full version).
CoRR abs/1504.03880.
Available at http://arxiv.org/abs/1504.03880.
Under submission.
Nathanaël Fijalkow & Martin Zimmermann (2014):
Parity and Streett Games with Costs.
Logical Methods in Computer Science 10(2),
doi:10.2168/LMCS-10(2:14)2014.
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,
pp. 291–305,
doi:10.1007/978-3-540-75292-9_20.
Fabio Mogavero, Aniello Murano & Loredana Sorrentino (2013):
On Promptness in Parity Games.
In: Kenneth L. McMillan, Aart Middeldorp & Andrei Voronkov: LPAR,
LNCS 8312.
Springer,
pp. 601–618,
doi:10.1007/978-3-642-45221-5_40.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of a Reactive Module.
In: POPL,
pp. 179–190,
doi:10.1145/75277.75293.
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 (2007):
Solving Parity Games in Big Steps.
In: Vikraman Arvind & Sanjiva Prasad: FSTTCS,
LNCS 4855.
Springer,
pp. 449–460,
doi:10.1007/978-3-540-77050-3_37.
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.
Michael Vanden Boom (2011):
Weak Cost Monadic Logic over Infinite Trees.
In: Filip Murlak & Piotr Sankowski: MFCS,
LNCS 6907.
Springer,
pp. 580–591,
doi:10.1007/978-3-642-22993-0_52.
Moshe Y. Vardi (2011):
The rise and fall of LTL.
In: Giovanna D'Agostino & Salvatore La Torre: GandALF,
EPTCS 54.
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.
Martin Zimmermann (2015):
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version).
CoRR abs/1505.06953v4.
Available at http://arxiv.org/abs/1505.06953v4.