Skip to main content
SpringerLink
Log in

Abstraction for model checking multi-agent systems

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Model checking multi-agent systems (MAS) always suffers from the state explosion problem. In this paper we focus on an abstraction technique which is one of the major methods for overcoming this problem. For a multi-agent system, we present a novel abstraction procedure which reduces the state space by collapsing the global states in the system. The abstraction is automatically computed according to the property to be verified. The resulting abstract system simulates the concrete system, while the universal temporal epistemic properties are preserved. Our abstraction is an overapproximation. If some universal temporal epistemic property is not satisfied, then we need to identify spurious counterexamples. We further show how to reduce complex counterexamples to simple structures, i.e., paths and loops, such that the counterexamples can be checked and the abstraction can be refined efficiently. Finally, we illustrate the abstraction technique with a card game.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Clarke E, Grumberg O, Peled D. Model Checking. Cambridge: MIT Press, 2000

    Google Scholar 

  2. Halpern J Y, Vardi M. Model checking vs. theorem proving: a manifesto. In: McCarthy J, Lifschitz V, eds. Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. San Diego: Academic Press, 1991, 151–176

    Google Scholar 

  3. Fagin R, Halpern J, Moses Y, Vardi M. Reasoning about Knowledge. Cambridge: MIT Press, 1995

    MATH  Google Scholar 

  4. van der Hoek W, Wooldridge M. Model checking knowledge and time. In: Proceedings of 9th International SPIN Workshop on Model Checking of Software. 2002, 95–111

  5. Su K, Sattar A, Luo X. Model checking temporal logics of knowledge via OBDDs. Computer Journal, 2007, 50(4): 403–420

    Article  Google Scholar 

  6. McMillan K. Symbolic Model Checking. Norwell: Kluwer Academic Publishers, 1993

    MATH  Google Scholar 

  7. Wu L, Su J, S K. Symbolic model checking knowledge and time in multi-agent system via extended mu-calculus. Chinese Journal of Computers, 2008, 31(02): 245–252 (in Chinese)

    Article  MathSciNet  Google Scholar 

  8. Luo X, Su K, Yang J. Bounded model checking for temporal epistemic logic in synchronous multi-agent systems. Journal of Software, 2006, 17(12): 2485–2498 (in Chinese)

    Article  MathSciNet  MATH  Google Scholar 

  9. Biere A, Cimatti A, Clarke E, Zhu Y. Symbolic model checking without BDDs. In: Proceedings of 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems. 1999, 193–207

  10. Peled D, Pnueli A. Proving partial order properties. Theoretical Computer Science, 1994, 126(2): 143–182

    Article  MathSciNet  MATH  Google Scholar 

  11. Emerson E, Sistla A. Symmetry and model checking. Formal Methods in System Design, 1996, 9(1–2): 105–131

    Article  Google Scholar 

  12. Wu L J, Su J S, Chen Q, Yang Z. Algorithm research on “on the fly” model checking temporal logics of knowledge in multi-agent systems. Journal of Computer Research and Development, 2006, 43(8): 1417–1424

    Article  Google Scholar 

  13. Clarke E M, Grumberg O, Long D E. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 1994, 16(5): 1512–1542

    Article  Google Scholar 

  14. Penczek W, Lomuscio A. Verifying epistemic properties of multi-Agent systems via bounded model checking. Fundamenta Informaticae, 2003, 55(2): 167–185

    MathSciNet  MATH  Google Scholar 

  15. Chaum D. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, 1988, 1(1): 65–75

    Article  MathSciNet  MATH  Google Scholar 

  16. Enea C, Dima C. Abstractions of multi-agent systems. In: Proceedings of 5th international Central and Eastern European conference on Multi-Agent Systems and Applications. 2007, 11–21

  17. Cohen M, Dam M, Lomuscio A, Russo F. Abstraction in model checking multi-agent systems. In: Proceeding of 8th International Conference on Autonomous Agents and Multiagent Systems. 2009, 945–952

  18. Clarke E M, Grumberg O, Jha S, Lu Y, Veith H. Counterexample-guided abstraction refinement. In: Proceedings of 12th International Conference on Computer Aided Verification. 2000, 154–169

  19. Clarke E M, Jha S, Lu Y, Veith H. Tree-like counterexamples in model checking. In: Proceeding of 17th IEEE Symposium on Logic in Computer Science. 2002, 19–29

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, 212013, China

    Conghua Zhou, Bo Sun & Zhifeng Liu

Authors
  1. Conghua Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bo Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhifeng Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Conghua Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, C., Sun, B. & Liu, Z. Abstraction for model checking multi-agent systems. Front. Comput. Sci. China 5, 14–25 (2011). https://doi.org/10.1007/s11704-010-0358-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-010-0358-y

Keywords

Search

Navigation