Model-checking Strategic Abilities in Information-sharing Systems
Article No.: 5, Pages 1 - 45
Abstract
We introduce a subclass of concurrent game structures (CGS) with imperfect information in which agents are endowed with private data-sharing capabilities. Importantly, our CGSs are such that it is still decidable to model-check these CGSs against a relevant fragment of ATL. These systems can be thought as a generalization of architectures allowing information forks, that is, cases where strategic abilities lead to certain agents outside a coalition privately sharing information with selected agents inside that coalition. Moreover, in our case, in the initial states of the system, we allow information forks from agents outside a given set \(A\) to agents inside this group \(A\). For this reason, together with the fact that the communication in our models underpins a specialized form of broadcast, we call our formalism \(A\) -cast systems. To underline, the fragment of ATL for which we show the model-checking problem to be decidable over \(A\)-cast is a large and significant one; it expresses coalitions over agents in any subset of the set \(A\). Indeed, as we show, our systems and this ATL fragments can encode security problems that are notoriously hard to express faithfully: terrorist-fraud attacks in identity schemes.
References
[1]
European Union. 2016. Regulation (EU) 2016/679 of the European Parliament and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing Directive 95/46/EC (General Data Protection Regulation). Official Journal of the European Union L119 (2016), 1–88. Retrieved from http://eur-lex.europa.eu/legal-content/EN/TXT/?uri=OJ:L:2016:119:TOC
[2]
Gildas Avoine, Muhammed Ali Bingöl, Ioana Boureanu, Srdjan čapkun, Gerhard Hancke, Süleyman Kardaş, Chong Hee Kim, Cédric Lauradoux, Benjamin Martin, Jorge Munilla, Alberto Peinado, Kasper Bonne Rasmussen, Dave Singelée, Aslan Tchamkerten, Rolando Trujillo-Rasua, and Serge Vaudenay. 2018. Security of distance-bounding: A survey. ACM Computing Surveys 51, 5, Article 94 (September 2018), 33 pages. DOI:
[3]
Rajeev Alur and Thomas A. Henzinger. 1999. Reactive modules. Form. Methods Syst. Des. 15, 1 (1999), 7–48. DOI:
[4]
R. Alur, T. A. Henzinger, and O. Kupferman. 2002. Alternating-time temporal logic. J. ACM 49, 5 (2002), 672–713.
[5]
Francesco Belardinelli, Ioana Boureanu, Catalin Dima, and Vadim Malvone. 2019. Verifying strategic abilities in multi-agent systems with private data-sharing. In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS ’19), 1820–1822. Retrieved from http://dl.acm.org/citation.cfm?id=3331930
[6]
F. Belardinelli, R. Condurache, C. Dima, W. Jamroga, and A. V. Jones. 2017. Bisimulations for verifying strategic abilities with an application to ThreeBallot. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems, 1286–1295.
[7]
Francesco Belardinelli, Rodica Condurache, Catalin Dima, Wojciech Jamroga, and Michal Knapik. 2021. Bisimulations for verifying strategic abilities with an application to the ThreeBallot Voting Protocol. Inf. Comput. 276 (2021), 104552.
[8]
Francesco Belardinelli, Catalin Dima, Vadim Malvone, and Ferucio Laurentiu Tiplea. 2020. A Hennessy-Milner theorem for ATL with imperfect information. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’20). Holger Hermanns, Lijun Zhang, Naoki Kobayashi, and Dale Miller (Eds.), ACM, 181–194. DOI:
[9]
Francesco Belardinelli, Angelo Ferrando, and Vadim Malvone. 2023. An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information. Artif. Intell. 316 (2023), 103847. DOI:
[10]
F. Belardinelli, U. Grandi, A. Herzig, D. Longin, E. Lorini, A. Novaro, and L. Perrussel. 2017. Relaxing exclusive control in boolean games. In Proceedings of 16th conference onTheoretical Aspects of Rationality and Knowledge (ARK ’17), 43–56.
[11]
Francesco Belardinelli, Alessio Lomuscio, Vadim Malvone, and Emily Yu. 2022. Approximating perfect recall when model checking strategic abilities: Theory and applications. J. Artif. Intell. Res. 73 (2022), 897–932. DOI:
[12]
Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, and Sasha Rubin. 2017. Verification of broadcasting multi-agent systems against an epistemic strategy logic. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI ’17). Carles Sierra (Ed.), 91–97. DOI:
[13]
F. Belardinelli, A. Lomuscio, A. Murano, and S. Rubin. 2017. Verification of multi-agent systems with imperfect information and public actions. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 1268–1276.
[14]
Francesco Belardinelli, Alessio Lomuscio, Aniello Murano, and Sasha Rubin. 2020. Verification of multi-agent systems with public actions against strategy logic. Artif. Intell. 285 (2020), 103302. DOI:
[15]
Samy Bengio, Gilles Brassard, Yvo Desmedt, Claude Goutier, and Jean-Jacques Quisquater. 1991. Secure implementations of identification systems. J. Cryptology 4, 3 (1991), 175–183. DOI:
[16]
Raphaël Berthon, Bastien Maubert, and Aniello Murano. 2017. Decidability results for ATL* with imperfect information and perfect recall. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS ’17). Kate Larson, Michael Winikoff, Sanmay Das, and Edmund H. Durfee (Eds.), ACM, 1250–1258. Retrieved from http://dl.acm.org/citation.cfm?id=3091299
[17]
Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, and Moshe Y. Vardi. 2017. Strategy logic with imperfect information. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS ’17). IEEE Computer Society, 1–12. DOI:
[18]
Dietmar Berwanger and Lukasz Kaiser. 2010. Information tracking in games on graphs. J. Log. Lang. Inf. 19, 4 (2010), 395–412. DOI:
[19]
Dietmar Berwanger and Anup Basil Mathew. 2017. Infinite games with finite knowledge gaps. Inf. Comput. 254 (2017), 217–237. DOI:
[20]
B. Blanchet. 2001. An efficient cryptographic protocol verifier based on prolog rules. In Proceedings of the IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, 82–96.
[21]
Bruno Blanchet. 2012. Security protocol verification: Symbolic and computational models. In Proceedings of the 1st International Conference (POST ’12), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS ’12), 3–29. DOI:
[22]
I. Boureanu and S. Vaudenay. 2015. Challenges in distance bounding. IEEE Secur. Priv. 13, 1 (Jan. 2015), 41–48. DOI:
[23]
S. Brands and D. Chaum. 1993. Distance-Bounding Protocols (Extended Abstract). In EUROCRYPT ’93, Lecture Notes in Computer Science, Vol. 765, Springer, 344–359.
[24]
Xavier Bultel, Sébastien Gambs, David Gérault, Pascal Lafourcade, Cristina Onete, and Jean-Marc Robert. 2016. A Prover-Anonymous and Terrorist-Fraud Resistant Distance-Bounding Protocol. In Proceedings of the 9th ACM Conference on Security & Privacy in Wireless and Mobile Networks (WiSec ’16). ACM, New York, NY, 121–133. DOI:
[25]
Krishnendu Chatterjee and Laurent Doyen. 2010. The complexity of partial-observation parity games. In Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR ’10), Lecture Notes in Computer Science, Vol. 6397, Springer, 1–14.
[26]
Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling. 2018. Proving Physical Proximity Using Symbolic Models. Research Report. Univ Rennes, CNRS, IRISA, France. Retrieved from https://hal.archives-ouvertes.fr/hal-01708336
[27]
Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling. 2019. Symbolic analysis of terrorist fraud resistance. In Proceedings of the 24th European Symposium on Research in Computer Security (ESORICS ’19), 383–403. DOI:
[28]
C. Dima, C. Enea, and D. P. Guelev. 2010. Model-checking an alternating-time temporal logic with knowledge, imperfect information, perfect recall and communicating coalitions. In Proceedings of 1st Symposium on Games, Automata, Logic, and Formal Verification (GANDALF ’10), 103–117.
[29]
C. Dima and F. L. Tiplea. 2011. Model-checking ATL under imperfect information and perfect recall semantics is undecidable. CoRR abs/1102.4225 (2011). arXiv:1102.4225. Retrieved from http://arxiv.org/abs/1102.4225
[30]
R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. 1995. Reasoning about Knowledge. MIT.
[31]
Angelo Ferrando and Vadim Malvone. 2022. Towards the combination of model checking and runtime verification on multi-agent systems. In Proceedings of the 20th International Conference on Advances in Practical Applications of Agents, Multi-Agent Systems, and Complex Systems Simulation. The PAAMS Collection (PAAMS ’22). Frank Dignum, Philippe Mathieu, Juan Manuel Corchado, and Fernando de la Prieta (Eds.), Lecture Notes in Computer Science, Vol. 13616, Springer, 140–152. DOI:
[32]
Angelo Ferrando and Vadim Malvone. 2023. Towards the verification of strategic properties in multi-agent systems with imperfect information. In Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (AAMAS ’23). Noa Agmon, Bo An, Alessandro Ricci, and William Yeoh (Eds.), ACM, 793–801. DOI:
[33]
Bernd Finkbeiner and Sven Schewe. 2005. Uniform Distributed Synthesis. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS ’05), 321–330. DOI:
[34]
J. Gerbrandy. 2006. Logics of propositional control. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems, 193–200. DOI:
[35]
U. Grandi, E. Lorini, A. Novaro, and L. Perrussel. 2017. Strategic disclosure of opinions on a social network. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 1196–1204.
[36]
D. Grossi, E. Lorini, and F. Schwarzentruber. 2015. The Ceteris Paribus Structure of Logics of Game Forms. J. Artif. Intell. Res. 53 (2015), 91–126. DOI:
[37]
J. Gutierrez, P. Harrenstein, and M. Wooldridge. 2017. Reasoning about equilibria in game-like concurrent systems. Ann. Pure Appl. Log. 168, 2 (2017), 373–403.
[38]
J. Gutierrez, G. Perelli, and M. Wooldridge. 2016. imperfect information in reactive modules games. In Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning, 390–400. Retrieved from http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12848
[39]
Julian Gutierrez, Giuseppe Perelli, and Michael J. Wooldridge. 2018. Imperfect information in reactive modules games. Inf. Comput. 261 (2018), 650–675. DOI:
[40]
Gerhard P. Hancke and Markus G. Kuhn. 2005. An RFID distance bounding protocol. In Proceedings of the 1st International Conference on Security and Privacy for Emerging Areas in Communications Networks, 67–73. DOI:
[41]
W. Jamroga, M. Knapik, and D. Kurpiewski. 2018. Model checking the SELENE E-Voting Protocol in multi-agent logics. In Electronic Voting. Springer International Publishing, 100–116.
[42]
Wojciech Jamroga, Damian Kurpiewski, and Vadim Malvone. 2022. How to Measure Usable Security: Natural strategies in voting protocols. J. Comput. Secur. 30, 3 (2022), 381–409. DOI:
[43]
W. Jamroga and W. van der Hoek. 2004. Agents that know how to play. Fund. Inf. 62 (2004), 1–35.
[44]
S. C. Kleene. 1952. Introduction to Metamathematics. North-Holland.
[45]
O. Kupferman and M. Y. Vardi. 2001. Synthesizing distributed systems. In Proceedings 16th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 389–398.
[46]
A. Lomuscio, H. Qu, and F. Raimondi. 2015. MCMAS: A model checker for the verification of multi-agent systems. Softw. Tools Technol. Trans. (2015). DOI:
[47]
F. Maffre. 2016. Ignorance Is Bliss: Observability-Based Dynamic Epistemic Logics and Their Applications. Ph.D. Dissertation. Université Paul Sabatier-Toulouse III.
[48]
S. Mauw, Z. Smith, J. Toro-Pozo, and R. Trujillo-Rasua. 2018. Distance-bounding protocols: Verification without time and location. In Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP ’18). Springer. DOI:
[49]
S. Meier, B. Schmidt, C. Cremers, and D. Basin. 2013. The TAMARIN prover for the symbolic analysis of security protocols. In Computer Aided Verification. Springer, Berlin, 696–701.
[50]
R. van der Meyden and T. Wilke. 2005. Synthesis of distributed systems from knowledge-based specifications. In Proceedings of the International Conference on Concurrency Theory, 562–576.
[51]
Nir Piterman. 2007. From nondeterministic Büchi and Streett Automata to deterministic parity automata. Log. Methods Comput. Sci. 3, 3 (2007). DOI:
[52]
A. Pnueli and R. Rosner. 1989. On the synthesis of a reactive module. In Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’89), 179–190.
[53]
Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. 2007. Algorithms for Omega-regular games with imperfect information. Log. Methods Comput. Sci. 3, 3 (2007).
[54]
R. Chadha, S. Kremer, and A. Scedrov. 2006. Formal analysis of multiparty contract signing. J. Autom. Reason. 36, 1–2 (Jan. 2006), 39–83. DOI:
[55]
M. Samaila, M. Neto, D. Fernandes, M. Freire, and P. Inácio. 2017. Security challenges of the internet of things. In Beyond the Internet of Things: Everything Interconnected. Springer International Publishing.
[56]
M. Tabatabaei, W. Jamroga, and P. Ryan. 2016. Expressing receipt-freeness and coercion-resistance in logics of strategic ability: Preliminary attempt. In Proceedings of the 1st International Workshop on AI for Privacy and Security, 1:1–1:8.
[57]
W. van der Hoek, A. Lomuscio, and M. Wooldridge. 2006. On the complexity of practical ATL model checking knowledge, strategies, and games in multi-agent systems. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS ’06). ACM Press, 201–208.
[58]
W. van der Hoek, D. Walther, and M. Wooldridge. 2010. Reasoning about the transfer of control. J. Artif. Intell. Res. 37 (2010), 437–477. DOI:
[59]
W. van der Hoek and M. Wooldridge. 2005. On the logic of cooperation and propositional control. Artif. Intell. 164, 1–2 (2005), 81–119. DOI:
[60]
H. van Ditmarsch, W. van der Hoek, and B. Kooi. 2007. Dynamic Epistemic Logic. In Synthese Library, Vol. 337, Springer.
Index Terms
- Model-checking Strategic Abilities in Information-sharing Systems
Recommendations
Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1
Alternating-time Temporal Logic (ATL) is typically applied for specifying properties of multi-agent systems modelled by game-like structures. This paper deals with verification of ATL by means of a fully symbolic model checking. Unbounded model checking ...
Model checking multi-agent systems with MABLE
AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2MABLE is a language for the design and automatic verification of multi-agent systems. MABLE is essentially a conventional imperative programming language, enriched by constructs from the agent-oriented programming paradigm. A MABLE system contains a ...
Formal Specification and Verification of Multi-Agent Systems
Multi-agent systems are increasingly complex, and the problem of their verification and validation is acquiring increasing importance. In this paper we show how a well known and effective verification technique, model checking, can be generalized to ...
Comments
Information & Contributors
Information
Published In
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 January 2025
Online AM: 19 November 2024
Accepted: 11 November 2024
Revised: 31 July 2024
Received: 12 February 2024
Published in TOCL Volume 26, Issue 1
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- JAM
- EPSRC Overseas Travel Grant
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 66Total Downloads
- Downloads (Last 12 months)66
- Downloads (Last 6 weeks)18
Reflects downloads up to 20 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in