Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Practical Abstraction for Model Checking of Multi-Agent Systems (2202.12016v4)

Published 24 Feb 2022 in cs.MA

Abstract: Model checking of multi-agent systems (MAS) is known to be hard, both theoretically and in practice. A smart abstraction of the state space may significantly reduce the model, and facilitate the verification. In this paper, we propose and study an intuitive agent-based abstraction scheme, based on the removal of variables in the representation of a MAS. This allows to do the reduction without generating the global model of the system. Moreover, the process is easy to understand and control even for domain experts with little knowledge of computer science. We formally prove the correctness of the approach, and evaluate the gains experimentally on models of a postal voting procedure.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Alternating refinement relations. In Proceedings of CONCUR (Lecture Notes in Computer Science, Vol. 1466). 163–178.
  2. R. Alur and T. A. Henzinger. 1999. Reactive Modules. Formal Methods in System Design 15, 1 (1999), 7–48.
  3. C. Baier and J.-P. Katoen. 2008. Principles of Model Checking. MIT Press.
  4. T. Ball and O. Kupferman. 2006. An Abstraction-Refinement Framework for Multi-Agent Systems. In Proceedings of Logic in Computer Science (LICS). IEEE, 379–388. https://doi.org/10.1109/LICS.2006.10
  5. A Tutorial on Uppaal. In Formal Methods for the Design of Real-Time Systems: SFM-RT (LNCS, 3185). Springer, 200–236.
  6. Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. Information and Computation 276 (2021), 104552. https://doi.org/10.1016/j.ic.2020.104552
  7. Francesco Belardinelli and Alessio Lomuscio. 2017. Agent-based Abstractions for Verifying Alternating-time Temporal Logic with Imperfect Information. In Proceedings of AAMAS. ACM, 1259–1267.
  8. An Abstraction-Based Method for Verifying Strategic Properties in Multi-Agent Systems with Imperfect Information. In Proceedings of AAAI. 6030–6037.
  9. Model Checking Logics of Strategic Ability: Complexity. In Specification and Verification of Multi-Agent Systems, M. Dastani, K. Hindriks, and J.-J. Meyer (Eds.). Springer, 125–159.
  10. Model Checking and Abstraction. ACM Transactions on Programming Languages and Systems 16, 5 (1994), 1512–1542.
  11. Handbook of Model Checking. Springer. https://doi.org/10.1007/978-3-319-10575-8
  12. Counterexample-Guided Abstraction Refinement. In Proceedings of CAV (Lecture Notes in Computer Science, Vol. 1855). Springer, 154–169. https://doi.org/10.1007/10722167_15
  13. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50, 5 (2003), 752–794. https://doi.org/10.1145/876638.876643
  14. Abstraction in model checking multi-agent systems. In Proceedings of (AAMAS. IFAAMAS, 945–952.
  15. Introduction to algorithms. MIT press.
  16. P. Cousot and R. Cousot. 1977. 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. 238–252. https://doi.org/10.1145/512950.512973
  17. Dennis Dams and Orna Grumberg. 2018. Abstraction and Abstraction Refinement. In Handbook of Model Checking. Springer, 385–419. https://doi.org/10.1007/978-3-319-10575-8_13
  18. Three-Valued Abstractions of Games: Uncertainty, but with Precision. In Proceedings of Logic in Computer Science (LICS). IEEE Computer Society, 170–179.
  19. Linear Time and Branching Time Semantics for Recursion with Merge. Theor. Comput. Sci. 34 (1984), 135–156. https://doi.org/10.1016/0304-3975(84)90114-2
  20. E.A. Emerson. 1990. Temporal and Modal Logic. In Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.). Vol. B. Elsevier, 995–1072.
  21. C. Enea and C. Dima. 2008. Abstractions of multi-agent systems. International Transactions on Systems Science and Applications 3, 4 (2008), 329–337.
  22. A Partial Order Approach to Branching Time Logic Model Checking. In Proceedings of ISTCS. IEEE, 130–139.
  23. P. Godefroid and R. Jagadeesan. 2002. Automatic Abstraction Using Generalized Model Checking. In Proceedings of Computer Aided Verification (CAV) (Lecture Notes in Computer Science, Vol. 2404). Springer, 137–150. https://doi.org/10.1007/3-540-45657-0_11
  24. X. Huang and R. van der Meyden. 2014. Symbolic Model Checking Epistemic Strategy Logic. In Proceedings of AAAI Conference on Artificial Intelligence. 1426–1432.
  25. Towards Model Checking of Voting Protocols in Uppaal. In Proceedings of E-Vote-ID (Lecture Notes in Computer Science, Vol. 12455). Springer, 129–146. https://doi.org/10.1007/978-3-030-60347-2_9
  26. A Survey of Requirements for COVID-19 Mitigation Strategies. Bulletin of The Polish Academy of Sciences: Technical Science 69, 4 (2021), e137724. https://doi.org/10.24425/bpasts.2021.137724
  27. Towards Partial Order Reductions for Strategic Ability. Journal of Artificial Intelligence Research 68 (2020), 817–850. https://doi.org/10.1613/jair.1.11936
  28. Verification of Multiagent Systems via Unbounded Model Checking. In Proceedings of AAMAS. IEEE Computer Society, 638–645. https://doi.org/10.1109/AAMAS.2004.10086
  29. P. Kouvaros and A. Lomuscio. 2017. Parameterised Verification of Infinite State Multi-Agent Systems via Predicate Abstraction. In Proceedings of AAAI. 3013–3020.
  30. STV+Reductions: Towards Practical Verification of Strategic Ability Using Model Reductions. In Proceedings of AAMAS. ACM, 1770–1772.
  31. A. Lomuscio and W. Penczek. 2007. Symbolic Model Checking for Temporal-Epistemic Logics. SIGACT News 38, 3 (2007), 77–99. https://doi.org/10.1145/1324215.1324231
  32. Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems. Fundamenta Informaticae 101, 1-2 (2010), 71–90. https://doi.org/10.3233/FI-2010-276
  33. Automatic Data-Abstraction in Model Checking Multi-Agent Systems. In Model Checking and Artificial Intelligence (Lecture Notes in Computer Science, Vol. 6572). Springer, 52–68. https://doi.org/10.1007/978-3-642-20674-0_4
  34. K.L. McMillan. 1993. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers.
  35. K.L. McMillan. 2002. Applying SAT Methods in Unbounded Symbolic Model Checking. In Proceedings of Computer Aided Verification (CAV) (Lecture Notes in Computer Science, Vol. 2404). 250–264.
  36. Rocco De Nicola and Frits W. Vaandrager. 1990. Action versus State based Logics for Transition Systems. In Semantics of Systems of Concurrent Processes, Proceedings of LITP Spring School on Theoretical Computer Science (Lecture Notes in Computer Science, Vol. 469). Springer, 407–419. https://doi.org/10.1007/3-540-53479-2_17
  37. Doron A. Peled. 1993. All from One, One for All: on Model Checking Using Representatives. In Proceedings of CAV (Lecture Notes in Computer Science, Vol. 697), Costas Courcoubetis (Ed.). Springer, 409–423. https://doi.org/10.1007/3-540-56922-7_34
  38. W. Penczek and A. Lomuscio. 2003. Verifying Epistemic Properties of Multi-Agent Systems via Bounded Model Checking. In Proceedings of AAMAS (Melbourne, Australia). ACM Press, New York, NY, USA, 209–216.
  39. Ph. Schnoebelen. 2003. The Complexity of Temporal Model Checking. In Advances in Modal Logics, Proceedings of AiML 2002. World Scientific.
  40. Sharon Shoham and Orna Grumberg. 2004. Monotonic Abstraction-Refinement for CTL. In Proceedings of TACAS (Lecture Notes in Computer Science, Vol. 2988). Springer, 546–560. https://doi.org/10.1007/978-3-540-24730-2_40
  41. Y. Shoham and K. Leyton-Brown. 2009. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press.
  42. M. Wooldridge. 2002. An Introduction to Multi Agent Systems. John Wiley & Sons.
Citations (4)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now