{"type":"ScholarlyArticle","title":"Practical Model Reductions for Verification of Multi-Agent Systems","authors":[{"name":"Wojciech Jamroga","slug":"wojciech-jamroga","given":"Wojciech","family":"Jamroga","affiliation":"Interdisciplinary Centre for Security , Reliability, and Trust , SnT , University of Luxembourg; Institute of Computer Science , Polish Academy of Science , Warsaw , Poland"},{"name":"Yan Kim","slug":"yan-kim","given":"Yan","family":"Kim","affiliation":"Interdisciplinary Centre for Security , Reliability, and Trust , SnT , University of Luxembourg"}],"abstract":"Formal verification of intelligent agents is often computationally infeasible due to state-space explosion.\r\nWe present a tool for reducing the impact of the explosion by means of state abstraction that is (a) easy to use and understand by non-experts, and (b) agent-based in the sense that it operates on a modular representation of the system, rather than on its huge explicit state model.","doi":"10.24963/ijcai.2023/834","url":"https://ijcai.org/proceedings/2023/834","pdf":"https://ijcai.org/proceedings/2023/0834.pdf","markdown":"https://ijcai.org/proceedings/2023/834.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/834","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Demo Track","track":"Demo Track","number":834,"pages":{"first":7135,"last":7139},"keywords":["Agent-based and Multi-agent Systems: MAS: Formal verification, validation and synthesis","Agent-based and Multi-agent Systems: MAS: Applications","Agent-based and Multi-agent Systems: MAS: Engineering methods, platforms, languages and tools"],"videos":[],"references":[{"position":1,"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":2,"raw":"[Ball and Kupferman, 2006] T. Ball and O. Kupferman. An abstraction-refinement framework for multi-agent systems. In Proceedings of Logic in Computer Science (LICS), pages 379-388. IEEE, 2006.","title":"An abstraction-refinement framework for multi-agent systems","authors":"T Ball, O Kupferman","year":"2006","venue":"Proceedings of Logic in Computer Science (LICS)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Behrmann et al., 2004] G. Behrmann, A. David, and K.G. Larsen. A tutorial on UPPAAL. In Formal Methods for the Design of Real-Time Systems: SFM-RT, number 3185 in LNCS, pages 200-236. Springer, 2004.","title":"A tutorial on UPPAAL","authors":"G Behrmann, A David, K G Larsen","year":"2004","venue":"Formal Methods for the Design of Real-Time Systems: SFM-RT","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Belardinelli et al., 2019] Francesco Belardinelli, Alessio Lo- muscio, and Vadim Malvone. An abstraction-based method for verifying strategic properties in multi-agent systems with imperfect information. In Proceedings of AAAI, pages 6030-6037, 2019.","title":"An abstraction-based method for verifying strategic properties in multi-agent systems with imperfect information","authors":"Francesco Belardinelli, Alessio Lomuscio, Vadim Malvone","year":"2019","venue":"Proceedings of AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cimatti et al., 2002] A. Cimatti, E.M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, M. Sebastiani, and A Tacchella. NuSMV2: An open-source tool for symbolic model checking. In Proceedings of Computer Aided Verification (CAV), volume 2404 of Lecture Notes in Computer Science, pages 359-364, 2002.","title":"NuSMV2: An open-source tool for symbolic model checking","authors":"A Cimatti, E M Clarke, E Giunchiglia, F Giunchiglia, M Pistore, M Roveri, M Sebastiani, Tacchella","year":"2002","venue":"Proceedings of Computer Aided Verification (CAV)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Clarke et al., 1994] E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Transac- tions on Programming Languages and Systems, 16(5):1512- 1542, 1994.","title":"Model checking and abstraction","authors":"E M Clarke, O Grumberg, D E Long","year":"1994","venue":"ACM Transactions on Programming Languages and Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Clarke et al., 2000] Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample- guided abstraction refinement. In Proceedings of CAV, volume 1855 of Lecture Notes in Computer Science, pages 154-169. Springer, 2000.","title":"Counterexampleguided abstraction refinement","authors":"Edmund M Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith","year":"2000","venue":"Proceedings of CAV","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Clarke et al., 2003] Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, and Helmut Veith. Counterexample- guided abstraction refinement for symbolic model checking. J. ACM, 50(5):752-794, 2003.","title":"Counterexampleguided abstraction refinement for symbolic model checking","authors":"Edmund M Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith","year":"2003","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Clarke et al., 2018] E.M. Clarke, T.A. Henzinger, H. Veith, and R. Bloem, editors. Handbook of Model Checking. Springer, 2018.","title":"Handbook of Model Checking","authors":"E M Clarke, T A","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cohen et al., 2009] Mika Cohen, Mads Dam, Alessio Lo- muscio, and Francesco Russo. Abstraction in model check- ing multi-agent systems. In AAMAS (2), pages 945-952.","title":"Abstraction in model checking multi-agent systems","authors":"Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco Russo","year":null,"venue":"AAMAS (2)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Cousot and Cousot, 1977] P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.","title":"Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints","authors":"P Cousot, R Cousot","year":"1977","venue":"Conference Record of the Fourth ACM Symposium on Principles of Programming Languages","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dams and Grumberg, 2018] Dennis Dams and Orna Grum- berg. Abstraction and abstraction refinement. In Handbook of Model Checking, pages 385-419. Springer, 2018.","title":"Dennis Dams and Orna Grumberg. Abstraction and abstraction refinement","authors":"Grumberg Dams","year":"2018","venue":"Handbook of Model Checking","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Emerson, 1990] E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Com- puter Science, volume B, pages 995-1072. Elsevier, 1990.","title":"Temporal and modal logic","authors":"E A Emerson","year":"1990","venue":"Handbook of Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Godefroid et al., 2001] P. Godefroid, M. Huth, and R. Ja- gadeesan. Abstraction-based model checking using modal transition systems. In Proceedings of CONCUR, volume 2154 of Lecture Notes in Computer Science, pages 426- 440, 2001.","title":"Abstraction-based model checking using modal transition systems","authors":"P Godefroid, M Huth, R Jagadeesan","year":"2001","venue":"Proceedings of CONCUR","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Godefroid et al., 2010] Patrice Godefroid, Aditya V. Nori, Sriram K. Rajamani, and SaiDeep Tetali. Compositional may-must program analysis: unleashing the power of al- ternation. In Proceedings of POPL, pages 43-56. ACM, 2010.","title":"Compositional may-must program analysis: unleashing the power of alternation","authors":"Patrice Godefroid, Aditya V Nori, K Sriram, Saideep Rajamani, Tetali","year":"2010","venue":"Proceedings of POPL","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Godefroid, 2014] Patrice Godefroid. May/must abstraction- based software model checking for sound verification and falsification. In Orna Grumberg, Helmut Seidl, and Maxi- milian Irlbeck, editors, Software Systems Safety, volume 36 of NATO Science for Peace and Security Series, D: Informa- tion and Communication Security, pages 1-16. IOS Press, 2014.","title":"May/must abstractionbased software model checking for sound verification and falsification","authors":"Patrice Godefroid","year":"2014","venue":"NATO Science for Peace and Security Series, D: Information and Communication Security","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gurfinkel et al., 2006] Arie Gurfinkel, Ou Wei, and Marsha Chechik. Yasm: A software model-checker for verification and refutation. In Proceedings of CAV, volume 4144 of Lec- ture Notes in Computer Science, pages 170-174. Springer, 2006.","title":"Yasm: A software model-checker for verification and refutation","authors":"Arie Gurfinkel, Ou Wei, Marsha Chechik","year":"2006","venue":"Proceedings of CAV","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Heaven, 2013] Douglas Heaven. Social AI likes to gossip. New Scientist, 218(2923):20, 2013.","title":"Social AI likes to gossip","authors":"Douglas Heaven","year":"2013","venue":"New Scientist","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hegedüs et al., 2021] István Hegedüs, Gábor Danner, and Márk Jelasity. Decentralized learning works: An empirical comparison of gossip learning and federated learning. J. Parallel Distributed Comput., 148:109-124, 2021.","title":"Decentralized learning works: An empirical comparison of gossip learning and federated learning","authors":"Hegedüs","year":"2021","venue":"J. Parallel Distributed Comput","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Jamroga and Kim, 2022] Wojciech Jamroga and Yan Kim. Practical abstraction for model checking of multi-agent systems. arXiv preprint arXiv:2202.12016, 2022.","title":"Practical abstraction for model checking of multi-agent systems","authors":"Wojciech Jamroga, Yan Kim","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Jamroga et al., 2020] W. Jamroga, W. Penczek, T. Sidoruk, P. Dembiński, and A. Mazurkiewicz. Towards partial or- der reductions for strategic ability. Journal of Artificial Intelligence Research, 68:817-850, 2020.","title":"Towards partial order reductions for strategic ability","authors":"W Jamroga, W Penczek, T Sidoruk, P Dembiński, A Mazurkiewicz","year":"2020","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Jamroga, 2015] W. Jamroga. Logical Methods for Specifi- cation and Verification of Multi-Agent Systems. ICS PAS Publishing House, 2015.","title":"Logical Methods for Specification and Verification of Multi-Agent Systems","authors":"W Jamroga","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kim et al., 2022] Yan Kim, Wojciech Jamroga, and Pe- ter Y.A. Ryan. Verification of the socio-technical aspects of voting: The case of the Polish postal vote 2020. In Proceedings of STAST, 2022. To appear, available at https://arxiv.org/abs/2210.10694.","title":"Verification of the socio-technical aspects of voting: The case of the Polish postal vote 2020","authors":"Yan Kim, Wojciech Jamroga, Peter Y A Ryan","year":"2022","venue":"Proceedings of STAST","doi":null,"url":"https://arxiv.org/abs/2210.10694","internal_url":null},{"position":24,"raw":"[Kurpiewski et al., 2021] Damian Kurpiewski, Witold Pazderski, Wojciech Jamroga, and Yan Kim. STV+Reductions: Towards practical verification of strategic ability using model reductions. In Proceedings of AAMAS, pages 1770-1772. ACM, 2021.","title":"STV+Reductions: Towards practical verification of strategic ability using model reductions","authors":"Damian Kurpiewski, Witold Pazderski, Wojciech Jamroga, Yan Kim","year":"2021","venue":"Proceedings of AAMAS","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Kurpiewski et al., 2023] Damian Kurpiewski, Wojciech Jamroga, and Teofil Sidoruk. Towards modelling and verifi- cation of social explainable AI. In Proceedings of ICAART, 2023. To appear, available at https://arxiv.org/abs/2302. 01063.","title":"Towards modelling and verification of social explainable AI","authors":"Damian Kurpiewski, Wojciech Jamroga, Teofil Sidoruk","year":"2023","venue":"Proceedings of ICAART","doi":null,"url":"https://arxiv.org/abs/2302.01063","internal_url":null},{"position":26,"raw":"[Lomuscio et al., 2017] A. Lomuscio, H. Qu, and F. Rai- mondi. MCMAS: An open-source model checker for the verification of multi-agent systems. International Journal on Software Tools for Technology Transfer, 19(1):9-30, 2017.","title":"MCMAS: An open-source model checker for the verification of multi-agent systems","authors":"A Lomuscio, H Qu, F Raimondi","year":"2017","venue":"International Journal on Software Tools for Technology Transfer","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Peled, 1993] Doron A. Peled. All from one, one for all: on model checking using representatives. In Costas Courcou- betis, editor, Proceedings of CAV, volume 697 of Lecture Notes in Computer Science, pages 409-423. Springer, 1993.","title":"All from one, one for all: on model checking using representatives","authors":"A Doron, Peled","year":"1993","venue":"Costas Courcoubetis","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Priese, 1983] L. Priese. Automata and concurrency. Theo- retical Computer Science, 25:221-265, 1983.","title":"Automata and concurrency","authors":"L Priese","year":"1983","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Schnoebelen, 2003] Ph. Schnoebelen. The complexity of temporal model checking. In Advances in Modal Logics, Proceedings of AiML 2002. World Scientific, 2003.","title":"The complexity of temporal model checking","authors":"; Schnoebelen, Ph, Schnoebelen","year":"2003","venue":"Advances in Modal Logics, Proceedings of AiML 2002","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Shoham and Grumberg, 2004] Sharon Shoham and Orna Grumberg. Monotonic abstraction-refinement for CTL. In Proceedings of TACAS, volume 2988 of Lecture Notes in Computer Science, pages 546-560. Springer, 2004.","title":"Monotonic abstraction-refinement for CTL","authors":"Grumberg Shoham, Sharon Shoham, Orna Grumberg","year":"2004","venue":"Proceedings of TACAS","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Shoham and Leyton-Brown, 2009] Y. Shoham and K. Leyton-Brown. Multiagent Systems -Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, 2009.","title":"Multiagent Systems -Algorithmic, Game-Theoretic, and Logical Foundations","authors":"Y Shoham, K Leyton-Brown","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Wooldridge, 2002] M. Wooldridge. An Introduction to Multi Agent Systems. John Wiley & Sons, 2002.","title":"An Introduction to Multi Agent Systems","authors":"M Wooldridge","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}