Rajeev Alur, Thomas Henzinger & Orna Kupferman (1997):
Alternating-time Temporal Logic.
In: Journal of the ACM.
IEEE Computer Society Press,
pp. 100–109,
doi:10.1007/3-540-49213-5_2.
Christel Baier & Joost-Pieter Katoen (2008):
Principles of model checking 26202649.
MIT press Cambridge.
Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li & Frank Stephan (2017):
Deciding parity games in quasipolynomial time.
In: Hamed Hatami, Pierre McKenzie & Valerie King: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017.
ACM,
pp. 252–263,
doi:10.1145/3055399.3055409.
Alonzo Church (1963):
Logic, arithmetic, and automata.
In: International Congress of Mathematicians (Stockholm, 1962).
Institute Mittag-Leffler,
Djursholm,
pp. 23–35,
doi:10.2307/2270398.
Edmund M Clarke & E Allen Emerson (1981):
Design and synthesis of synchronization skeletons using branching time temporal logic.
In: Workshop on Logic of Programs.
Springer,
pp. 52–71,
doi:10.1007/BFb0025774.
E. Allen Emerson & Joseph Y. Halpern (1986):
`Sometimes' and `Not Never' Revisited: On Branching versus Linear Time Temporal Logic.
J. ACM 33(1),
pp. 151–178,
doi:10.1145/4904.4999.
E. Allen Emerson & A. Prasad Sistla (1984):
Deciding full branching time logic.
Information and Control 61(3),
pp. 175 – 201,
doi:10.1016/S0019-9958(84)80047-9.
Bernd Finkbeiner & Sven Schewe (2013):
Bounded synthesis.
STTT 15(5-6),
pp. 519–539,
doi:10.1007/s10009-012-0228-z.
Swen Jacobs, Roderick Bloem, Romain Brenguier, Ayrat Khalimov, Felix Klein, Robert Könighofer, Jens Kreber, Alexander Legg, Nina Narodytska, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup & Adam Walker (2016):
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
In: Ruzica Piskac & Rayna Dimitrova: Proceedings Fifth Workshop on Synthesis, SYNT@CAV 2016, Toronto, Canada, July 17-18, 2016.,
EPTCS 229,
pp. 149–177,
doi:10.4204/EPTCS.229.12.
Ayrat Khalimov & Roderick Bloem (2017):
Bounded Synthesis for Streett, Rabin, and CTL*,
pp. 333–352.
Springer International Publishing,
doi:10.1007/978-3-319-63390-9_18.
Ayrat Khalimov, Swen Jacobs & Roderick Bloem (2013):
PARTY parameterized synthesis of token rings.
In: Computer Aided Verification.
Springer,
pp. 928–933,
doi:10.1007/978-3-642-39799-8_66.
Orna Kupferman & Moshe Y. Vardi (1999):
Church's problem revisited.
Bulletin of Symbolic Logic 5(2),
pp. 245–263,
doi:10.1145/357084.357090.
Orna Kupferman, Moshe Y. Vardi & Pierre Wolper (2000):
An Automata-theoretic Approach to Branching-time Model Checking.
J. ACM 47(2),
pp. 312–360,
doi:10.1145/333979.333987.
Nir Piterman (2007):
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata.
Logical Methods in Computer Science Volume 3, Issue 3,
doi:10.1109/LICS.2006.28.
Amir Pnueli (1977):
The temporal logic of programs.
In: Foundations of Computer Science, 1977., 18th Annual Symposium on.
IEEE,
pp. 46–57,
doi:10.1109/SFCS.1977.32.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of a Reactive Module.
In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 11-13, 1989.
ACM Press,
pp. 179–190,
doi:10.1145/75277.75293.
Roni Rosner (1992):
Modular synthesis of reactive systems.
PhD thesis, Weizmann Institute of Science.
Shmuel Safra (1988):
On the Complexity of omega-Automata.
In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988.
IEEE Computer Society,
pp. 319–327,
doi:10.1109/SFCS.1988.21948.
Sven Schewe (2009):
Tighter Bounds for the Determinisation of Büchi Automata.
In: Proceedings of the Twelfth International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2009), 22–29 March, York, England, UK,
Lecture Notes in Computer Science 5504.
Springer-Verlag,
pp. 167–181,
doi:10.1007/978-3-642-00596-1_13.
Moshe Y Vardi (2001):
Branching vs. linear time: Final showdown.
In: TACAS 1.
Springer,
pp. 1–22,
doi:10.1007/3-540-45319-9_1.