{"type":"ScholarlyArticle","title":"Model Checking Multi-Agent Systems against LDLK Specifications","authors":[{"name":"Jeremy Kong","slug":"jeremy-kong","given":"Jeremy","family":"Kong","affiliation":"Department of Computing , Imperial College London"},{"name":"Alessio Lomuscio","slug":"alessio-lomuscio","given":"Alessio","family":"Lomuscio","affiliation":"Department of Computing , Imperial College London"}],"abstract":"We define the logic LDLK, a formalism for specifying multi-agent systems. LDLK extends LDL with epistemic modalities, including common knowledge, for reasoning about the evolution of knowledge states of the agents in the system. We study the complexity of verifying a multi-agent system against LDLK specifications and show this to be in PSPACE. We give an algorithm for the practical verification of multi-agent systems specified in LDLK. We show that the model checking algorithm, based on alternating-automata and \u000fnFA, is amenable to symbolic implementation on OBDDs. We introduce MCMAS LDLK , an extension of the open-source model checker MCMAS, implementing the algorithm and discuss the experimental results obtained.","doi":"10.24963/ijcai.2017/158","url":"https://ijcai.org/proceedings/2017/158","pdf":"https://ijcai.org/proceedings/2017/0158.pdf","markdown":"https://ijcai.org/proceedings/2017/158.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/158","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":158,"pages":{"first":1138,"last":1144},"keywords":["Agent-based and Multi-agent Systems: Formal verification, validation and synthesis","Multidisciplinary Topics and Applications: Validation and Verification","Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation"],"videos":[],"references":[{"position":1,"raw":"[Bloem et al., 2006] R. Bloem, A. Cimatti, I. Pill, M. Roveri, and S. Semprini. Symbolic implementation of alternating automata. In International Conference on Implementation and Application of Automata, pages 208-218. Springer, 2006.","title":"Symbolic implementation of alternating automata","authors":"R Bloem, A Cimatti, I Pill, M Roveri, S Semprini","year":"2006","venue":"International Conference on Implementation and Application of Automata","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bryant, 1986] R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, 35(8):677-691, 1986.","title":"Graph-based algorithms for boolean function manipulation","authors":"R Bryant","year":"1986","venue":"IEEE Transaction on Computers","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Burch et al., 1990] J. R. Burch, E. M. Clarke, K. L. McMil- lan, D. L. Dill, and L. J. Hwang. Sequential circuit verifi- cation using symbolic model checking. In Design Automa- tion Conference, 1990. Proceedings., 27th ACM/IEEE, pages 46-51. IEEE, 1990.","title":"Sequential circuit verification using symbolic model checking","authors":"J R Burch, E M Clarke, K L Mcmillan, D L Dill, L J Hwang","year":"1990","venue":"Design Automation Conference","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cermák et al., 2014] P. Cermák, A. Lomuscio, F. Mo- gavero, and A. Murano. MCMAS-SLK: A model checker for the verification of strategy logic specifications. In Pro- ceedings of the 26th International Conference on Com- puter Aided Verification (CAV14), volume 8559 of Lec- ture Notes in Computer Science, pages 525-532. Springer, 2014.","title":"MCMAS-SLK: A model checker for the verification of strategy logic specifications","authors":"P Cermák, A Lomuscio, F Mogavero, A Murano","year":"2014","venue":"Proceedings of the 26th International Conference on Computer Aided Verification (CAV14)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cimatti et al., 1999] A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In Proceedings of the 11th International Computer Aided Verification Conference, pages 495-499, 1999.","title":"NuSMV: A new symbolic model verifier","authors":"A Cimatti, E Clarke, F Giunchiglia, M Roveri","year":"1999","venue":"Proceedings of the 11th International Computer Aided Verification Conference","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cimatti et al., 2006] A. Cimatti, M. Roveri, S. Semprini, and S. Tonetta. From PSL to NBA: a modular symbolic encoding. In 2006 Formal Methods in Computer Aided Design, pages 125-133. IEEE, 2006.","title":"From PSL to NBA: a modular symbolic encoding","authors":"A Cimatti, M Roveri, S Semprini, S Tonetta","year":"2006","venue":"Formal Methods in Computer Aided Design","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[De Giacomo and Vardi, 2015] G. De Giacomo and M. Y. Vardi. Synthesis for LTL and LDL on finite traces. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI15), pages 1558-1564. AAAI Press, 2015.","title":"Synthesis for LTL and LDL on finite traces","authors":"De Giacomo, ; Vardi, G De, Giacomo, M Y Vardi","year":"2015","venue":"Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI15)","doi":null,"url":null,"internal_url":"/proceedings/2015/223"},{"position":8,"raw":"[De Giacomo and Vardi, 2016] G. De Giacomo and M. Y. Vardi. LTL f and LDL f synthesis under partial observabil- ity. In Proceedings of the 25th International Joint Con- ference on Artificial Intelligence (IJCAI16), pages 1044- 1050. IJCAI/AAAI Press, 2016.","title":"LTL f and LDL f synthesis under partial observability","authors":"De Giacomo, ; Vardi, G De, Giacomo, M Y Vardi","year":"2016","venue":"Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI16)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[De Giacomo et al., 2014] G. De Giacomo, R. De Masellis, M. Grasso, F. M. Maggi, and M. Montali. Monitoring business metaconstraints based on LTL and LDL for finite traces. In Proceedings of the 12th International Confer- ence on Business Process Management (BPM14), volume 8659 of Lecture Notes in Computer Science, pages 1-17. Springer, 2014.","title":"Monitoring business metaconstraints based on LTL and LDL for finite traces","authors":"G De Giacomo, R De Masellis, M Grasso, F M Maggi, M Montali","year":"2014","venue":"Proceedings of the 12th International Conference on Business Process Management (BPM14)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ditmarsch et al., 2010] H. van Ditmarsch, J. van Eijck, and W. Wu. Verifying one hundred prisoners and a lightbulb. Journal of Applied Non-Classical Logics, 20(3):173-191, 2010.","title":"Verifying one hundred prisoners and a lightbulb","authors":"H Van Ditmarsch, J Van Eijck, W Wu","year":"2010","venue":"Journal of Applied Non-Classical Logics","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Emerson and Lei, 1985] E. A. Emerson and C. L. Lei. Modalities for model checking: Branching time logic strikes back. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pages 84-96, 1985.","title":"Modalities for model checking: Branching time logic strikes back","authors":"E A Emerson, C L Lei","year":"1985","venue":"Proceedings of the 12th ACM Symposium on Principles of Programming Languages","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fagin et al., 1995] R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.","title":"Reasoning about Knowledge","authors":"R Fagin, J Y Halpern, Y Moses, M Y Vardi","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Faymonville and Zimmermann, 2015] P. Faymonville and M. Zimmermann. Parametric linear dynamic logic (full version). arXiv preprint arXiv:1504.03880, 2015.","title":"Parametric linear dynamic logic","authors":"P Faymonville, M Zimmermann","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Fischer and Ladner, 1977] M. J. Fischer and R. E. Ladner. Propositional modal logic of programs (extended abstract). In Proceedings of the 9th Annual ACM Symposium on The- ory of Computing (STOC77), pages 286-294. ACM, 1977.","title":"Propositional modal logic of programs (extended abstract)","authors":"M J Fischer, R E Ladner","year":"1977","venue":"Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC77)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gammie and van der Meyden, 2004] P. Gammie and R. van der Meyden. MCK: Model checking the logic of knowledge. In Proceedings of 16th International Conference on Computer Aided Verification (CAV04), volume 3114 of Lecture Notes in Computer Science, pages 479-483. Springer, 2004.","title":"MCK: Model checking the logic of knowledge","authors":"P Gammie, R Van Der Meyden","year":"2004","venue":"Proceedings of 16th International Conference on Computer Aided Verification (CAV04)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[van der Hoek and Wooldridge, 2002] W. van der Hoek and M. Wooldridge. Tractable multiagent planning for epis- temic goals. In Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Sys- tems (AAMAS02), pages 1167-1174. ACM Press, 2002.","title":"Tractable multiagent planning for epistemic goals","authors":"Hoek Van Der, ] W Wooldridge, M Van Der Hoek, Wooldridge","year":"2002","venue":"Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS02)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kacprzak et al., 2008] M. Kacprzak, W. Nabialek, A. Niewiadomski, W. Penczek, A. Pólrola, M. Szreter, B. Woźna, and A. Zbrzezny. Verics 2007 -a model checker for knowledge and real-time. Fundamenta Informaticae, 85(1):313-328, 2008.","title":"Verics 2007 -a model checker for knowledge and real-time","authors":"M Kacprzak, W Nabialek, A Niewiadomski, W Penczek, A Pólrola, M Szreter, B Woźna, A Zbrzezny","year":"2008","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Lomuscio et al., 2015] A. Lomuscio, H. Qu, and F. Rai- mondi. MCMAS: A model checker for the verification of multi-agent systems. Software Tools for Technology Trans- fer, 2015. http://dx.doi.org/10.1007/s10009-015-0378-x.","title":"MCMAS: A model checker for the verification of multi-agent systems","authors":"A Lomuscio, H Qu, F Raimondi","year":"2015","venue":"Software Tools for Technology Transfer","doi":"10.1007/s10009-015-0378-x","url":"http://dx.doi.org/10.1007/s10009-015-0378-x","internal_url":null},{"position":19,"raw":"[MCMAS LDLK , 2017] MCMAS LDLK . . http://vas.doc.ic.ac.uk/, 2017.","title":"MCMAS LDLK","authors":"Mcmas Ldlk","year":"2017","venue":null,"doi":null,"url":"http://vas.doc.ic.ac.uk/","internal_url":null},{"position":20,"raw":"[Penczek and Lomuscio, 2003] W. Penczek and A. Lomus- cio. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae, 55(2):167-185, 2003.","title":"Verifying epistemic properties of multi-agent systems via bounded model checking","authors":"W Penczek, A Lomuscio","year":"2003","venue":"Fundamenta Informaticae","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Pnueli, 1977] A. Pnueli. The temporal logic of programs. In Proceedings of the 18th International Symposium Founda- tions of Computer Science (FOCS77), pages 46-57, 1977.","title":"The temporal logic of programs","authors":"A Pnueli","year":"1977","venue":"Proceedings of the 18th International Symposium Foundations of Computer Science (FOCS77)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Raimondi and Lomuscio, 2004] F. Raimondi and A. Lo- muscio. Automatic verification of deontic interpreted sys- tems by model checking via OBDDs. In Proceedings of the Sixteenth European Conference on Artificial Intelli- gence (ECAI04), pages 53-57. IOS Press, 2004.","title":"Automatic verification of deontic interpreted systems by model checking via OBDDs","authors":"F Raimondi, A Lomuscio","year":"2004","venue":"Proceedings of the Sixteenth European Conference on Artificial Intelligence (ECAI04)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Thompson, 1968] Ken Thompson. Programming tech- niques: Regular expression search algorithm. Communi- cations of the ACM, 11(6):419-422, 1968.","title":"Programming techniques: Regular expression search algorithm","authors":"Ken Thompson, Thompson","year":"1968","venue":"Communications of the ACM","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Vardi, 2011] M. Y. Vardi. The rise and fall of linear time logic. In 2nd International Symposium on Games, Au- tomata, Logics, and Formal Verification, 2011.","title":"The rise and fall of linear time logic","authors":"M Y Vardi","year":"2011","venue":"2nd International Symposium on Games, Automata, Logics, and Formal Verification","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Wolper, 1981] P. Wolper. Temporal logic can be more ex- pressive. In 22nd Annual Symposium on Foundations of Computer Science (SFCS81), pages 340-348. IEEE, 1981.","title":"Temporal logic can be more expressive","authors":"P Wolper","year":"1981","venue":"22nd Annual Symposium on Foundations of Computer Science (SFCS81)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}