Behavioral QLTL

In this paper we introduce Behavioral QLTL, which is a “behavioral” variant of linear-time temporal logic on infinite traces with second-order quantifiers. Behavioral QLTL is characterized by the fact that the functions that assign the truth value of the quantified propositions along the trace can only depend on the past. In other words such functions must be“processes”. This gives to the logic a strategic flavor that we usually associate to planning. Indeed we show that temporally extended planning in nondeterministic domains, as well as LTL synthesis, are expressed in Behavioral QLTL through formulas with a simple quantification alternation. While, as this alternation increases, we get to forms of planning/synthesis in which conditional and conformant planning aspects get mixed. We study this logic from the computational point of view and compare it to the original QLTL (with non-behavioral semantics) and with simpler forms of behavioral semantics.

[1]  Krishnendu Chatterjee,et al.  Environment Assumptions for Synthesis , 2008, CONCUR.

[2]  Bernd Finkbeiner,et al.  Uniform distributed synthesis , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[3]  Paolo Traverso,et al.  Strong Cyclic Planning Revisited , 1999, ECP.

[4]  Nir Piterman,et al.  From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[5]  Sven Schewe,et al.  Synthesis of Distributed Systems , 2018 .

[6]  Erich Grädel,et al.  Dependence and Independence , 2012, Stud Logica.

[7]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[8]  Piergiorgio Bertoli,et al.  Heuristic Search + Symbolic Model Checking = Efficient Conformant Planning , 2001, IJCAI.

[9]  Merlijn Sevenster,et al.  Independence-Friendly Logic - a Game-Theoretic Approach , 2011, London Mathematical Society lecture note series.

[10]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[11]  David E. Muller,et al.  Alternating automata on infinite objects, determinacy and Rabin's theorem , 1984, Automata on Infinite Words.

[12]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

[13]  Andreas Blass,et al.  Henkin quantifiers and complete problems , 1986, Ann. Pure Appl. Log..

[14]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[15]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[16]  Marco Roveri,et al.  Conformant Planning via Symbolic Model Checking , 2000, J. Artif. Intell. Res..

[17]  Marta Cialdea Mayer,et al.  Bounded Model Search in Linear Temporal Logic and Its Application to Planning , 1998, TABLEAUX.

[18]  Jussi Rintanen,et al.  Complexity of Planning with Partial Observability , 2004, ICAPS.

[19]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[20]  Orna Kupferman,et al.  Synthesizing Distributed Systems , 2001, LICS.

[21]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[22]  Fahiem Bacchus,et al.  Planning for temporally extended goals , 1996, Annals of Mathematics and Artificial Intelligence.

[23]  Saharon Shelah,et al.  On the Temporal Basis of Fairness. , 1980 .

[24]  Aravinda Prasad Sistla,et al.  Theoretical issues in the design and verification of distributed systems , 1983 .

[25]  Giuseppe De Giacomo,et al.  Planning under LTL Environment Specifications , 2019, ICAPS.

[26]  Marcin Mostowski,et al.  Decidability Problems in Languages with Henkin Quantifiers , 1992, Ann. Pure Appl. Log..

[27]  Alberto Camacho,et al.  Towards a Unified View of AI Planning and Reactive Synthesis , 2019, ICAPS.

[28]  Dov M. Gabbay,et al.  MetateM: An introduction , 1995, Formal Aspects of Computing.

[29]  Patricia Bouyer,et al.  Dependences in Strategy Logic , 2018, STACS.

[30]  Aniello Murano,et al.  Concurrent Multi-Player Parity Games , 2016, AAMAS.

[31]  Krishnendu Chatterjee,et al.  Assume-Guarantee Synthesis , 2007, TACAS.

[32]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[33]  Diego Calvanese,et al.  Reasoning about Actions and Planning in LTL Action Theories , 2002, KR.

[34]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[35]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[36]  Fausto Giunchiglia,et al.  Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.