Relentful Strategic Reasoning in Alternating-Time Temporal Logic
- 621 Downloads
Temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems. Within this family, alternating temporal logic, Atl *, has been introduced as a useful generalization of classical linear- and branching-time temporal logics by allowing temporal operators to be indexed by coalitions of agents. Classically, temporal logics are memoryless: once a path in the computation tree is quantified at a given node, the computation that has led to that node is forgotten. Recently, mCtl * has been defined as a memoryful variant of Ctl *, where path quantification is memoryful. In the context of multi-agent planning, memoryful quantification enables agents to “relent” and change their goals and strategies depending on their past history. In this paper, we define mAtl *, a memoryful extension of Atl *, in which a formula is satisfied at a certain node of a path by taking into account both the future and the past. We study the expressive power of mAtl *, its succinctness, as well as related decision problems. We also investigate the relationship between memoryful quantification and past modalities and show their equivalence. We show that both the memoryful and the past extensions come without any computational price; indeed, we prove that both the satisfiability and the model-checking problems are 2ExpTime-Complete, as they are for Atl *.
KeywordsModel Check Temporal Logic Multiagent System Atomic Proposition State Formula
Unable to display preview. Download preview PDF.
- KP95.Kupferman, O., Pnueli, A.: Once and For All. In: LICS 1995, pp. 25–35. IEEE Computer Society, Los Alamitos (1995)Google Scholar
- KV06.Kupferman, O., Vardi, M.Y.: Memoryful Branching-Time Logic. In: LICS 2006, pp. 265–274. IEEE Computer Society, Los Alamitos (2006)Google Scholar
- LMS02.Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal Logic with Forgettable Past. In: LICS 2002, pp. 383–392. IEEE Computer Society, Los Alamitos (2002)Google Scholar
- LPZ85.Lichtenstein, O., Pnueli, A., Zuck, L.D.: The Glory of the Past. In: LP 1985, pp. 196–218 (1985)Google Scholar
- PV07.Pistore, M., Vardi, M.Y.: The Planning Spectrum - One, Two, Three, Infinity. In: JAIR 2007, vol. 30, pp. 101–132 (2007)Google Scholar
- Var88.Vardi, M.Y.: A Temporal Fixpoint Calculus. In: POPL 1988, pp. 250–259 (1988)Google Scholar
- vdHWW02.van der Hoek, W., Wooldridge, M.: Tractable multiagent planning for epistemic goals. In: AAMAS 2002, pp. 1167–1174 (2002)Google Scholar
- WW01.Woolridge, M.J.: Introduction to Multiagent Systems. John Wiley & Sons, Chichester (2001)Google Scholar