{"type":"ScholarlyArticle","title":"Alternating-time Temporal Logic on Finite Traces","authors":[{"name":"Francesco Belardinelli","slug":"francesco-belardinelli","given":"Francesco","family":"Belardinelli","affiliation":"Laboratoire IBISC , UEVE , France"},{"name":"Alessio Lomuscio","slug":"alessio-lomuscio","given":"Alessio","family":"Lomuscio","affiliation":"Department of Computing , Imperial College London , UK"},{"name":"Aniello Murano","slug":"aniello-murano","given":"Aniello","family":"Murano","affiliation":"DIETI , Università degli Studi di Napoli , Italy"},{"name":"Sasha Rubin","slug":"sasha-rubin","given":"Sasha","family":"Rubin","affiliation":"DIETI , Università degli Studi di Napoli , Italy"}],"abstract":"We develop a logic-based technique to analyse finite interactions in multi-agent systems. We introduce a semantics for Alternating-time Temporal Logic (for both perfect and imperfect recall) and its branching-time fragments in which paths are finite instead of infinite.  We study validities of these logics and present optimal algorithms for their model-checking problems in the perfect recall case.","doi":"10.24963/ijcai.2018/11","url":"https://ijcai.org/proceedings/2018/11","pdf":"https://ijcai.org/proceedings/2018/0011.pdf","markdown":"https://ijcai.org/proceedings/2018/11.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/11","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":11,"pages":{"first":77,"last":83},"keywords":["Agent-based and Multi-agent Systems: Agent Theories and Models","Agent-based and Multi-agent Systems: Formal Verification, Validation and Synthesis"],"videos":[],"references":[{"position":1,"raw":"[Alur et al., 2002] R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49(5):672-713, 2002.","title":"Alternating-time temporal logic","authors":"R Alur, T Henzinger, O Kupferman","year":"2002","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bacchus and Kabanza, 2000] F. Bacchus and F. Kabanza. Using temporal logics to express search control knowl- edge for planning. Artificial Intelligence, 116(1-2):123- 191, 2000.","title":"Using temporal logics to express search control knowledge for planning","authors":"F Bacchus, F Kabanza","year":"2000","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baier and Katoen, 2008] C. Baier and J. P. Katoen. Princi- ples of Model Checking. MIT Press, 2008.","title":"Principles of Model Checking","authors":"C Baier, J P Katoen","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baier and McIlraith, 2006] J. A. Baier and S. A. McIlraith. Planning with first-order temporally extended goals using heuristic search. In AAAI, pages 788-795, 2006.","title":"Planning with first-order temporally extended goals using heuristic search","authors":"J A Baier, S A Mcilraith","year":"2006","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Camacho et al., 2017] A. Camacho, E. Triantafillou, C. J. Muise, J. A. Baier, and S. A. McIlraith. Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces. In AAAI, pages 3716-3724, 2017.","title":"Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces","authors":"A Camacho, E Triantafillou, C J Muise, J A Baier, S A Mcilraith","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Clarke et al., 1986] E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach. ACM TOPLAS, 8(2):244-263, 1986.","title":"Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach","authors":"E M Clarke, E A Emerson, A P Sistla","year":"1986","venue":"ACM TOPLAS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[De Giacomo and Vardi, 2013] G. De Giacomo and M. Y. Vardi. Linear temporal logic and linear dynamic logic on finite traces. In IJCAI, pages 854-860, 2013.","title":"Linear temporal logic and linear dynamic logic on finite traces","authors":"De Giacomo, ; Vardi, G De, Giacomo, M Y Vardi","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/132"},{"position":8,"raw":"[De Giacomo and Vardi, 2015] G. De Giacomo and M. Y. Vardi. Synthesis for LTL and LDL on finite traces. In IJCAI, pages 1558-1564, 2015.","title":"Synthesis for LTL and LDL on finite traces","authors":"De Giacomo, ; Vardi, G De, Giacomo, M Y Vardi","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/223"},{"position":9,"raw":"[De Giacomo et al., 2014a] G. De Giacomo, R. De Masel- lis, M. Grasso, F. M. Maggi, and M. Montali. Monitoring business metaconstraints based on LTL and LDL for finite traces. In BPM, LNCS 8659, pages 1-17, 2014.","title":"Monitoring business metaconstraints based on LTL and LDL for finite traces","authors":"Giacomo De","year":"2014","venue":"BPM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[De Giacomo et al., 2014b] G. De Giacomo, R. De Masellis, and M. Montali. Reasoning on LTL on finite traces: Insen- sitivity to infiniteness. In AAAI, pages 1027-1033, 2014.","title":"Reasoning on LTL on finite traces: Insensitivity to infiniteness","authors":"Giacomo De","year":"2014","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Emerson and Halpern, 1986] E. A. Emerson and J. Y. Halpern. \"sometimes\" and \"not never\" revisited: on branching versus linear time temporal logic. Journal of the ACM, 33(1):151-178, 1986.","title":"sometimes\" and \"not never\" revisited: on branching versus linear time temporal logic","authors":"E A Emerson, J Y Halpern","year":"1986","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Emerson and Lei, 1985] E. A. Emerson and C. L. Lei. Modalities for model checking: Branching time logic strikes back. In POPL, pages 84-96, 1985.","title":"Modalities for model checking: Branching time logic strikes back","authors":"E A Emerson, C L Lei","year":"1985","venue":"POPL","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Emerson et al., 2001] E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model checking for the µ-calculus and its frag- ments. Theor. Comp. Sci., 258(1-2):491-522, 2001.","title":"On model checking for the µ-calculus and its fragments","authors":"E A Emerson, C S Jutla, A P Sistla","year":"2001","venue":"Theor. Comp. Sci","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Filiot et al., 2011] E. Filiot, N. Jin, and J.-F. Raskin. An- tichains and compositional algorithms for LTL synthesis. Formal Methods in System Design, 39(3):261-296, 2011.","title":"Antichains and compositional algorithms for LTL synthesis","authors":"E Filiot, N Jin, J.-F Raskin","year":"2011","venue":"Formal Methods in System Design","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Geffner and Bonet, 2013] H. Geffner and B. Bonet. A Con- cise Introduction to Models and Methods for Automated Planning. Morgan & Claypool Publishers, 2013.","title":"A Concise Introduction to Models and Methods for Automated Planning","authors":"H Geffner, B Bonet","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gerevini et al., 2009] A. Gerevini, P. Haslum, D. Long, A. Saetti, and Y. Dimopoulos. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artificial Intelli- gence, 173(5-6):619-668, 2009.","title":"Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners","authors":"A Gerevini, P Haslum, D Long, A Saetti, Y Dimopoulos","year":"2009","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Grädel et al., 2002] E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of LNCS. Springer, 2002.","title":"Automata, Logics, and Infinite Games: A Guide to Current Research","authors":null,"year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gutierrez et al., 2017] J. Gutierrez, G. Perelli, and M. Wooldridge. Iterated games with LDL goals over finite traces. In AAMAS, pages 696-704, 2017.","title":"Iterated games with LDL goals over finite traces","authors":"J Gutierrez, G Perelli, M Wooldridge","year":"2017","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Harel and Pnueli, 1985] D. Harel and A. Pnueli. On the de- velopment of reactive systems. In Logics and models of concurrent systems, pages 477-498. Springer, 1985.","title":"On the development of reactive systems","authors":"D Harel, A Pnueli","year":"1985","venue":"Logics and models of concurrent systems","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hopcroft and Ullman, 1979] J. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Compu- tation. Adison-Wesley Publishing Company, 1979.","title":"Introduction to Automata Theory, Languages, and Computation","authors":"J Hopcroft, J D Ullman","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Jennings et al., 2001] N. R. Jennings, P. Faratin, A. Lomus- cio, S. Parsons, M. Wooldridge, and C. Sierra. Automated negotiation: prospects, methods and challenges. Group Decision and Negotiation, 10(2):199-215, 2001.","title":"Automated negotiation: prospects, methods and challenges","authors":"N R Jennings, P Faratin, A Lomuscio, S Parsons, M Wooldridge, C Sierra","year":"2001","venue":"Group Decision and Negotiation","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kong and Lomuscio, 2018] J. Kong and A. Lomuscio. Model checking multi-agent systems against ldlk specifi- cations on finite traces. In AAMAS, 2018. To Appear. Kupferman et al., 2006]","title":"Model checking multi-agent systems against ldlk specifications on finite traces","authors":"J Kong, A Lomuscio","year":"2006","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"O. Kupferman, N. Piterman, and M. Y. Vardi. Safraless compositional synthesis. In CAV, LNCS 4144, pages 31-44, 2006.","title":"Safraless compositional synthesis","authors":"O Kupferman, N Piterman, M Y Vardi","year":"2006","venue":"CAV, LNCS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mogavero et al., 2014] F. Mogavero, A. Murano, G. Perelli, and M. Y. Vardi. Reasoning about strategies: On the model-checking problem. ACM Transactions on Compu- tational Logic, 15(4):34:1-34:47, 2014.","title":"Reasoning about strategies: On the model-checking problem","authors":"F Mogavero, A Murano, G Perelli, M Y Vardi","year":"2014","venue":"ACM Transactions on Computational Logic","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Montali et al., 2010] M. Montali, M. Pesic, W. M. P. van der Aalst, F. Chesani, P. Mello, and S. Storari. Declarative specification and verification of service choreographiess. ACM Transactions on the Web (TWEB), 4(1):3, 2010.","title":"Declarative specification and verification of service choreographiess","authors":"M Montali, M Pesic, W M P Van Der Aalst, F Chesani, P Mello, S Storari","year":"2010","venue":"ACM Transactions on the Web (TWEB)","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pauly and Parikh, 2003] M. Pauly and R. Parikh. Game logic -an overview. Studia Logica, 75(2):165-182, 2003.","title":"Game logic -an overview","authors":"M Pauly, R Parikh","year":"2003","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Pesic et al., 2010] M. Pesic, D. Bosnacki, and W. M. P. ra- van der Aalst. Enacting declarative languages using LTL: avoiding errors and improving performance. In SPIN, LNCS 6349, pages 146-161, 2010.","title":"Enacting declarative languages using LTL: avoiding errors and improving performance","authors":"M Pesic, D Bosnacki, W M P Der Aalst","year":"2010","venue":"SPIN","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Rabin and Scott, 1959] M. O. Rabin and D. S. Scott. Finite Automata and their Decision Problems. IBM Journal of Research & Development, 3:115-125, 1959.","title":"Finite Automata and their Decision Problems","authors":"M O Rabin, D S Scott","year":"1959","venue":"IBM Journal of Research & Development","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Schnoebelen, 2003] Ph. Schnoebelen. The complexity of temporal logic model checking. In AiML02, volume 4 of Advances in Modal Logic, pages 437-459. 2003.","title":"The complexity of temporal logic model checking","authors":"; Schnoebelen, Ph, Schnoebelen","year":"2003","venue":"Advances in Modal Logic","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Tsai et al., 2014] M.-H. Tsai, S. Fogarty, M. Y. Vardi, and Y.-K. Tsay. State of Büchi complementation. Logical Methods in Computer Science, 10(4), 2014.","title":"State of Büchi complementation","authors":"M.-H Tsai, S Fogarty, M Y Vardi, Y.-K Tsay","year":"2014","venue":"Logical Methods in Computer Science","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Vardi and Stockmeyer, 1985] M. Y. Vardi and L. Stock- meyer. Improved upper and lower bounds for modal logics of programs. In STOC, pages 240-251, 1985.","title":"Improved upper and lower bounds for modal logics of programs","authors":"M Y Vardi, L Stockmeyer","year":"1985","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Vardi and Wolper, 1994] M. Y. Vardi and P. Wolper. Rea- soning about infinite computations. Information and Com- putation, 115(1):1-37, 1994.","title":"Reasoning about infinite computations","authors":"M Y Vardi, P Wolper","year":"1994","venue":"Information and Computation","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}