Aaron Bohy, Véronique Bruyère, Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2012):
Acacia+, a Tool for LTL Synthesis.
In: CAV,
pp. 652–657,
doi:10.1007/978-3-642-31424-7_45.
Blai Bonet & Hector Geffner (2000):
Planning with Incomplete Information as Heuristic Search in Belief Space.
In: Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems,
pp. 52–61.
Randal E. Bryant (1986):
Graph-Based Algorithms for Boolean Function Manipulation.
IEEE Trans. Computers 35(8),
pp. 677–691,
doi:10.1109/TC.1986.1676819.
Daniel Bryce, Subbarao Kambhampati & David E. Smith (2006):
Planning Graph Heuristics for Belief Space Search.
J. Artif. Intell. Res. 26,
pp. 35–99,
doi:10.1613/jair.1869.
J. Büchi (1960):
Weak Second-Order Arithmetic and Finite Automata.
Mathematical Logic Quarterly - MLQ 6,
pp. 66–92,
doi:10.1002/malq.19600060105.
Alberto Camacho, Jorge A. Baier, Christian J. Muise & Sheila A. McIlraith (2018):
Finite LTL Synthesis as Planning.
In: ICAPS,
pp. 29–38.
Alberto Camacho, Meghyn Bienvenu & Sheila A. McIlraith (2019):
Towards a Unified View of AI Planning and Reactive Synthesis.
In: ICAPS,
pp. 58–67.
Ashok K. Chandra, Dexter Kozen & Larry J. Stockmeyer (1981):
Alternation.
J. ACM 28(1),
pp. 114–133,
doi:10.1145/322234.322243.
Giuseppe De Giacomo & Moshe Y. Vardi (2013):
Linear Temporal Logic and Linear Dynamic Logic on Finite Traces.
In: IJCAI,
pp. 854–860.
Giuseppe De Giacomo & Moshe Y. Vardi (2015):
Synthesis for LTL and LDL on Finite Traces.
In: IJCAI,
pp. 1558–1564.
Giuseppe De Giacomo & Moshe Y. Vardi (2016):
LTL_\voidb@x f and LDL_\voidb@x f Synthesis under Partial Observability.
In: IJCAI,
pp. 1044–1050.
Laurent Doyen & Jean-François Raskin (2011):
Games with Imperfect Information: Theory and Algorithms,
pp. 185212.
Cambridge University Press,
doi:10.1017/CBO9780511973468.007.
Alexandre Duret-Lutz, Alexandre Lewkowicz, Amaury Fauchille, Thibaud Michaud, Etienne Renault & Laurent Xu (2016):
Spot 2.0 — A Framework for LTL and ω-automata Manipulation.
In: ATVA,
doi:10.1007/978-3-319-46520-3_8.
Rüdiger Ehlers (2011):
Unbeast: Symbolic Bounded Synthesis.
In: Parosh Aziz Abdulla & K. Rustan M. Leino: TACAS,
Lecture Notes in Computer Science 6605.
Springer,
pp. 272–275,
doi:10.1007/978-3-642-19835-9_25.
Peter Faymonville, Bernd Finkbeiner & Leander Tentrup (2017):
BoSy: An Experimentation Framework for Bounded Synthesis.
In: CAV,
pp. 325–332,
doi:10.1007/978-3-319-63390-9_17.
Eric Felt, Gary York, Robert K. Brayton & Alberto L. Sangiovanni-Vincentelli (1993):
Dynamic Variable Reordering for BDD Minimization.
In: EURO-DAC.
IEEE Computer Society,
pp. 130–135,
doi:10.1109/EURDAC.1993.410627.
Kathi Fisler & Moshe Y. Vardi (2002):
Bisimulation Minimization and Symbolic Model Checking.
Formal Methods Syst. Des. 21(1),
pp. 39–78,
doi:10.1023/A:1016091902809.
Seth Fogarty, Orna Kupferman, Moshe Y. Vardi & Thomas Wilke (2013):
Profile Trees for Büchi Word Automata, with Application to Determinization.
In: GandALF,
pp. 107–121,
doi:10.4204/EPTCS.119.11.
Robert P. Goldman & Mark S. Boddy (1996):
Expressive Planning and Explicit Knowledge.
In: Proceedings of the Third International Conference on Artificial Intelligence Planning Systems,
pp. 110–117.
Keliang He, Andrew M. Wells, Lydia E. Kavraki & Moshe Y. Vardi (2019):
Efficient Symbolic Reactive Synthesis for Finite-Horizon Tasks.
In: ICRA,
pp. 8993–8999,
doi:10.1109/ICRA.2019.8794170.
Jesper G. Henriksen, Jakob L. Jensen, Michael E. Jørgensen, Nils Klarlund, Robert Paige, Theis Rauhe & Anders Sandholm (1995):
Mona: Monadic Second-Order Logic in Practice.
In: TACAS,
pp. 89–110,
doi:10.1007/3-540-60630-0_5.
Orna Kupferman & Moshe Vardi (1997):
Synthesis with Incomplete Informatio.
In: ICTL,
pp. 1044–1050,
doi:10.1007/978-94-015-9586-5_6.
Shlomi Maliah, Ronen I. Brafman, Erez Karpas & Guy Shani (2014):
Partially Observable Online Contingent Planning Using Landmark Heuristics.
In: ICAPS.
Philipp J. Meyer, Salomon Sickert & Michael Luttenberger (2018):
Strix: Explicit Reactive Synthesis Strikes Back!.
In: Hana Chockler & Georg Weissenbacher: CAV,
Lecture Notes in Computer Science 10981.
Springer,
pp. 578–586,
doi:10.1007/978-3-319-96145-3_31.
Amir Pnueli (1977):
The Temporal Logic of Programs.
In: 18th Annual Symposium on Foundations of Computer Science,
pp. 46–57,
doi:10.1109/SFCS.1977.32.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of a Reactive Module.
In: Sixteenth Annual ACM Symposium on Principles of Programming Languages,
pp. 179–190,
doi:10.1145/75277.75293.
John H. Reif (1984):
The Complexity of Two-Player Games of Incomplete Information.
J. Comput. Syst. Sci. 29(2),
pp. 274–301,
doi:10.1016/0022-0000(84)90034-5.
Jussi Rintanen (2004):
Complexity of Planning with Partial Observability.
In: ICAPS,
pp. 345–354.
Roni Rosner (1991):
Modular Synthesis of Reactive Systems.
A. Prasad Sistla, Moshe Y. Vardi & Pierre Wolper (1985):
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract).
In: Automata, Languages and Programming, 12th Colloquium,
pp. 465–474,
doi:10.1007/BFb0015772.
Larry J. Stockmeyer & Ashok K. Chandra (1979):
Provably Difficult Combinatorial Games.
SIAM J. Comput. 8(2),
pp. 151–174,
doi:10.1137/0208013.
Deian Tabakov, Kristin Y. Rozier & Moshe Y. Vardi (2012):
Optimized Temporal Monitors for SystemC.
Formal Methods in System Design 41(3),
pp. 236–268,
doi:10.1007/s10703-011-0139-8.
Moshe Y. Vardi & Larry J. Stockmeyer (1985):
Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report.
In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing,
pp. 240–251,
doi:10.1145/22145.22173.
Shufang Zhu, Geguang Pu & Moshe Y. Vardi (2019):
First-Order vs. Second-Order Encodings for LTL_f-to-Automata Translation.
In: TAMC,
pp. 684–705,
doi:10.1007/978-3-030-14812-6_43.
Shufang Zhu, Lucas M. Tabajara, Jianwen Li, Geguang Pu & Moshe Y. Vardi (2017):
Symbolic LTLf Synthesis.
In: IJCAI,
pp. 1362–1369,
doi:10.24963/ijcai.2017/189.
Wieslaw Zielonka (1998):
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theor. Comput. Sci. 200(1-2),
pp. 135–183,
doi:10.1016/S0304-3975(98)00009-7.
eptcs@eptcs.org