{"type":"ScholarlyArticle","title":"On Computational Tractability for Rational Verification","authors":[{"name":"Julian Gutierrez","slug":"julian-gutierrez","given":"Julian","family":"Gutierrez","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Muhammad Najib","slug":"muhammad-najib","given":"Muhammad","family":"Najib","affiliation":"Department of Computer Science , University of Oxford , UK"},{"name":"Giuseppe Perelli","slug":"giuseppe-perelli","given":"Giuseppe","family":"Perelli","affiliation":"Department of Informatics , University of Leicester , UK"},{"name":"Michael Wooldridge","slug":"michael-wooldridge","given":"Michael","family":"Wooldridge","affiliation":"Department of Computer Science , University of Oxford , UK"}],"abstract":"Rational verification involves checking which temporal logic properties hold of a concurrent and multiagent system, under the assumption that agents in the system choose strategies in game theoretic equilibrium. Rational verification can be understood as a counterpart of model checking for multiagent systems, but while model checking can be done in polynomial time for some temporal logic specification languages such as CTL, and polynomial space with LTL specifications, rational verification is much more intractable: it is 2EXPTIME-complete with LTL specifications, even when using explicit-state system representations.  In this paper we show that the complexity of rational verification can be greatly reduced by restricting specifications to GR(1), a fragment of LTL that can represent most response properties of reactive systems. We also provide improved complexity results for rational verification when considering players' goals given by mean-payoff utility functions -- arguably the most widely used quantitative objective for agents in concurrent and multiagent systems. In particular, we show that for a number of relevant settings, rational verification can be done in polynomial space or even in polynomial time.","doi":"10.24963/ijcai.2019/47","url":"https://ijcai.org/proceedings/2019/47","pdf":"https://ijcai.org/proceedings/2019/0047.pdf","markdown":"https://ijcai.org/proceedings/2019/47.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/47","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":47,"pages":{"first":329,"last":335},"keywords":["Knowledge Representation and Reasoning: Knowledge Representation and Reasoning for Game Playing","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 and La Torre, 2004] Rajeev Alur and Salvatore La Torre. Deterministic Generators and Games for LTL Fragments. ACM Transactions on Computational Logic, 5(1):1-25, 2004.","title":"Deterministic Generators and Games for LTL Fragments","authors":"Rajeev Alur, Salvatore La, Torre","year":"2004","venue":"ACM Transactions on Computational Logic","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alur et al., 2002] Rajeev Alur, Thomas Henzinger, and Orna Kupferman. Alternating-Time Temporal Logic. Journal of the ACM, 49(5):672-713, 2002.","title":"Alternating-Time Temporal Logic","authors":"Rajeev Alur, Thomas Henzinger, Orna Kupferman","year":"2002","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bloem et al., 2012] Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, and Yaniv Sa'ar. Synthesis of reactive(1) designs. Journal of Computer and System Sciences, 78(3):911-938, 2012.","title":"Synthesis of reactive(1) designs","authors":"Roderick Bloem, Barbara Jobstmann, Nir Piterman, Amir Pnueli, Yaniv Sa, ' Ar","year":"2012","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Boker et al., 2014] Udi Boker, Krishnendu Chatterjee, Thomas Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. ACM Trans- actions on Computational Logic, 15(4):27:1-27:25, 2014.","title":"Temporal Specifications with Accumulative Values","authors":"Udi Boker, Krishnendu Chatterjee, Thomas Henzinger, Orna Kupferman","year":"2014","venue":"ACM Transactions on Computational Logic","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Calude et al., 2017] Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, and Frank Stephan. Deciding parity games in quasipolynomial time. In STOC, pages 252-263. ACM, 2017.","title":"Deciding parity games in quasipolynomial time","authors":"Cristian S Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan","year":"2017","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Clarke et al., 2018] Edmund M. Clarke, Orna Grumberg, Daniel Kroening, Doron Peled, and Helmut Veith. Model Checking (2nd edition). MIT Press, 2018.","title":"Model Checking","authors":"Edmund M Clarke, Orna Grumberg, Daniel Kroening, Doron Peled, Helmut Veith","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Emerson, 1990] E. Allen Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science Vol- ume B: Formal Models and Semantics, pages 996-1072. Elsevier, 1990.","title":"Temporal and modal logic","authors":"E, Allen Emerson","year":"1990","venue":"Handbook of Theoretical Computer Science Volume B: Formal Models and Semantics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Filiot et al., 2018] Emmanuel Filiot, Raffaella Gentilini, and Jean-Franc ¸ois Raskin. Rational Synthesis Under Im- perfect Information. In LICS, pages 422-431. ACM, 2018.","title":"Rational Synthesis Under Imperfect Information","authors":"Emmanuel Filiot, Raffaella Gentilini, Jean-Franc ¸ois Raskin","year":"2018","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Fisman et al., 2010] Dana Fisman, Orna Kupferman, and Yoad Lustig. Rational Synthesis. In TACAS, volume 6015 of LNCS, pages 190-204. Springer, 2010.","title":"Rational Synthesis","authors":"Dana Fisman, Orna Kupferman, Yoad Lustig","year":"2010","venue":"TACAS","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gao et al., 2017] Tong Gao, Julian Gutierrez, and Michael Wooldridge. Iterated Boolean Games for Rational Verifi- cation. In AAMAS, pages 705-713. ACM, 2017.","title":"Iterated Boolean Games for Rational Verification","authors":"Tong Gao, Julian Gutierrez, Michael Wooldridge","year":"2017","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gutierrez et al., 2015a] Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge. Expresiveness and Complexity Results for Strategic Reasoning. In CONCUR, volume 42 of LIPIcs, pages 268-282. Schloss Dagstuhl, 2015.","title":"Expresiveness and Complexity Results for Strategic Reasoning","authors":"Gutierrez","year":"2015","venue":"CONCUR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gutierrez et al., 2015b] Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge. Iterated Boolean Games. Infor- mation and Computation, 242:53-79, 2015.","title":"Iterated Boolean Games","authors":"Gutierrez","year":"2015","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gutierrez et al., 2017a] Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge. From Model Checking to Equi- librium Checking: Reactive Modules for Rational Verifi- cation. Artificial Intelligence, 248:123-157, 2017.","title":"From Model Checking to Equilibrium Checking: Reactive Modules for Rational Verification","authors":"Gutierrez","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gutierrez et al., 2017b] Julian Gutierrez, Paul Harrenstein, and Michael Wooldridge. Reasoning about Equilibria in Game-like Concurrent Systems. Annals of Pure and Ap- plied Logic, 168(2):373-403, 2017.","title":"Reasoning about Equilibria in Game-like Concurrent Systems","authors":"Gutierrez","year":"2017","venue":"Annals of Pure and Applied Logic","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gutierrez et al., 2017c] Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, and Michael Wooldridge. Nash Equilibria in Concurrent Games with Lexicographic Preferences. In IJCAI, pages 1067-1073, 2017.","title":"Nash Equilibria in Concurrent Games with Lexicographic Preferences","authors":"Gutierrez","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/148"},{"position":16,"raw":"[Gutierrez et al., 2018a] Julian Gutierrez, Muhammad Na- jib, Giuseppe Perelli, and Michael Wooldridge. EVE: A Tool for Temporal Equilibrium Analysis. In ATVA, vol- ume 11138 of LNCS, pages 551-557. Springer, 2018.","title":"EVE: A Tool for Temporal Equilibrium Analysis","authors":"Gutierrez","year":"2018","venue":"ATVA","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gutierrez et al., 2018b] Julian Gutierrez, Giuseppe Perelli, and Michael Wooldridge. Imperfect Information in Re- active Modules games. Information and Computation, 261(Part):650-675, 2018.","title":"Imperfect Information in Reactive Modules games","authors":"Gutierrez","year":"2018","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kupferman et al., 2016] Orna Kupferman, Giuseppe Perelli, and Moshe Vardi. Synthesis with Rational Environments. Annals of Mathematics and Artificial Intelligence, 78(1):3-20, 2016.","title":"Synthesis with Rational Environments","authors":"Orna Kupferman, Giuseppe Perelli, Moshe Vardi","year":"2016","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kupferman, 2015] Orna Kupferman. Automata Theory and Model Checking. Handbook of TCS, 2015.","title":"Automata Theory and Model Checking","authors":"Orna Kupferman, Kupferman","year":"2015","venue":"Handbook of TCS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Osborne and Rubinstein, 1994] Martin J. Osborne and Ariel Rubinstein. A Course in Game Theory. MIT Press, 1994.","title":"A Course in Game Theory","authors":"Martin J Osborne, Ariel Rubinstein","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Piterman and Pnueli, 2006] Nir Piterman and Amir Pnueli. Faster Solutions of Rabin and Streett Games. In LICS, pages 275-284, 2006.","title":"Faster Solutions of Rabin and Streett Games","authors":"Pnueli Piterman, Nir Piterman, Amir Pnueli","year":"2006","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pnueli and Rosner, 1989] Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In POPL, pages 179- 190. ACM Press, 1989.","title":"On the synthesis of a reactive module","authors":"Rosner Pnueli, Amir Pnueli, Roni Rosner","year":"1989","venue":"POPL","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Pnueli, 1977] Amir Pnueli. The Temporal Logic of Pro- grams. In FOCS, pages 46-57. IEEE, 1977.","title":"The Temporal Logic of Programs","authors":"Amir Pnueli, Pnueli","year":"1977","venue":"FOCS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rauch Henzinger and Telle, 1996] Monika Rauch Hen- zinger and Jan Telle. Faster Algorithms for the Nonempti- ness of Streett Automata and for Communication Protocol Pruning. In SWAT, pages 16-27, 1996.","title":"Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning","authors":"Rauch Henzinger, Monika Rauch Telle, Jan Henzinger, Telle","year":"1996","venue":"SWAT","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Toumi et al., 2015] Alexis Toumi, Julian Gutierrez, and Michael Wooldridge. A Tool for the Automated Verifica- tion of Nash Equilibria in Concurrent Games. In ICTAC, volume 9399 of LNCS, pages 583-594. Springer, 2015.","title":"A Tool for the Automated Verification of Nash Equilibria in Concurrent Games","authors":"Alexis Toumi, Julian Gutierrez, Michael Wooldridge","year":"2015","venue":"ICTAC","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Ummels and Wojtczak, 2011] Michael Ummels and Do- minik Wojtczak. The Complexity of Nash Equilibria in Limit-Average Games. In CONCUR, pages 482-496, 2011.","title":"Michael Ummels and Dominik Wojtczak. The Complexity of Nash Equilibria in Limit-Average Games","authors":"Wojtczak Ummels","year":"2011","venue":"CONCUR","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Wooldridge et al., 2016] Michael Wooldridge, Julian Gutierrez, Paul Harrenstein, Enrico Marchioni, Giuseppe Perelli, and Alexis Toumi. Rational Verification: From Model Checking to Equilibrium Checking. In AAAI, pages 4184-4191. AAAI Press, 2016.","title":"Rational Verification: From Model Checking to Equilibrium Checking","authors":"Michael Wooldridge, Julian Gutierrez, Paul Harrenstein, Enrico Marchioni, Giuseppe Perelli, Alexis Toumi","year":"2016","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Zwick and Paterson, 1996] Uri Zwick and Mike Paterson. The Complexity of Mean Payoff Games on Graphs. Theo- retical Computer Science, 158(1):343 -359, 1996.","title":"The Complexity of Mean Payoff Games on Graphs","authors":"Paterson Zwick, Uri Zwick, Mike Paterson","year":"1996","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}