article

Verifying epistemic properties of multi-agent systems via bounded model checking

Authors:

Wojciech Penczek,

Alessio LomuscioAuthors Info & Claims

Fundamenta Informaticae, Volume 55, Issue 2

Pages 167 - 185

Published: 01 August 2002 Publication History

Abstract

We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of coordination in multi-agent systems.

References

[1]

{1} A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. of TACAS'99, volume 1579 of LNCS, pages 193-207. Springer-Verlag, 1999.]]

Digital Library

[2]

{2} M. E. Bratman. Intentions, Plans, and Practical Reason. Harvard University Press: Cambridge, MA, 1987.]]

[3]

{3} E. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1):7-34, 2001.]]

Digital Library

[4]

{4} E. M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.]]

Digital Library

[5]

{5} E. A. Emerson. Handbook of Theoretical Computer Science, volume B: Formal Methods and Semantics, chapter Temporal and Modal Logic, pages 995-1067. Elsevier, 1990.]]

[6]

{6} E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.]]

[7]

{7} R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.]]

Digital Library

[8]

{8} R. Fagin, J. Y. Halpern, and M. Y. Vardi. What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM, 39(2):328-376, Apr. 1992.]]

Digital Library

[9]

{9} J. Halpern, R. Meyden, and M. Y. Vardi. Complete axiomatisations for reasoning about knowledge and time. SIAM Journal on Computing, 2003. To Appear.]]

[10]

{10} J. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549-587, 1990. A preliminary version appeared in Proc. 3rd ACM Symposium on Principles of Distributed Computing, 1984.]]

Digital Library

[11]

{11} W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In Proc. of the 9th Int. SPIN Workshop (SPIN'02), volume 2318 of LNCS, pages 95-111. Springer-Verlag, 2002.]]

[12]

{12} W. van der Hoek and M. Wooldridge. Tractable multiagent planning for epistemic goals. In Proc. of the 1st Int. Conf on Autonomous Agents and Multi-Agent Systems (AAMAS'02), July 2002. to appear.]]

[13]

{13} R. van der Meyden and H. Shilov. Model checking knowledge and time in systems with perfect knowledge. In Proceedings of Proc. of FST&TCS, volume 1738 of Lecture Notes in Computer Science, pages 432-445, Hyderabad, India, 1999.]]

Digital Library

[14]

{14} ISO/IEC 9074(E), Estelle - a formal description technique based on an extended state-transition model. International Standards Organization, 1997.]]

[15]

{15} B. van Linder, W. van der Hoek, and J.-J. Meyer. Seeing is believing, and so are hearing and jumping. Journal of Logic, Language, and Information, 6(1):33-61, 1997.]]

[16]

{16} A. Lomuscio, T. Lasica, and W. Penczek. Bounded model checking for interpreted systems: preliminary experimental results. In M. Hinchey, editor, Proceedings of FAABS II, volume 2699 of LNCS. Springer Verlag, 2003.]]

[17]

{17} A. Lomuscio, R. Meyden, and M. Ryan. Knowledge in multi-agent systems: Initial configurations and broadcast. ACM Transactions of Computational Logic, 1(2), 2000.]]

Digital Library

[18]

{18} A. Lomuscio, F. Raimondi, and M. Sergot. Towards model checking interpreted systems. In Proceedings of Mochart -- First International Workshop on Model Checking and Artificial Intelligence, 2002.]]

[19]

{19} A. Lomuscio and M. Sergot. Deontic interpreted systems. Studia Logica, 75, 2003.]]

[20]

{20} M.-P. H. M. Wooldridge, M. Fisher and S. Parsons. Model checking multiagent systems with mable. In Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems (AAMAS-02), Bologna, Italy, July 2002.]]

Digital Library

[21]

{21} Z. Manna and A. Pnueli. The temporal logic of reactive and concurrent systems, volume 1. Springer-Verlag, Berlin/New York, 1992.]]

Digital Library

[22]

{22} R. v. Meyden and K. Wong. Complete axiomatizations for reasoning about knowledge and branching time. Studia Logica, 75, 2003.]]

[23]

{23} J.-J. C. Meyer and R. J. Wieringa. Deontic logic: A concise overview. In Deontic Logic in Computer Science, Wiley Professional Computing Series, chapter 1, pages 3-16. John Wiley and Sons, Chichester, UK, 1993.]]

[24]

{24} M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference (DACO1), pages 530-535, June 2001.]]

[25]

{25} W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. In T. Sandholm, editor, Proceedings of the Second International Joint Conference on Autonomous Agents and Multi-agent systems (AAMAS-03), 2003.]]

[26]

{26} W. Penczek, B. Wozna, and A. Zbrzezny. Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae, 51 (1-2): 135-156, 2002.]]

Digital Library

[27]

{27} A. S. Rao and M. P. Georgeff. Decision procedures for BDI logics. Journal of Logic and Computation, 8(3):293-343, June 1998.]]

[28]

{28} M. Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of ICMAS, International Conference of Multi-Agent Systems. IEEE Press, 2000.]]

Digital Library

Cited By

Konur SFisher MSchewe S(2013)Combined model checking for temporal, probabilistic, and real-time logicsTheoretical Computer Science10.5555/2846457.2846510503:C(61-88)Online publication date: 9-Sep-2013
https://dl.acm.org/doi/10.5555/2846457.2846510
Meski APenczek WSzreter MWoźna-Szcześniak BZbrzezny A(2012)Bounded model checking for knowledge and linear timeProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2343896.2344054(1447-1448)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343896.2344054
Jones AKnapik MPenczek WLomuscio A(2012)Group synthesis for parametric temporal-epistemic logicProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 210.5555/2343776.2343855(1107-1114)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343776.2343855
Show More Cited By

Index Terms

Verifying epistemic properties of multi-agent systems via bounded model checking
1. Computing methodologies
  1. Artificial intelligence
    1. Distributed artificial intelligence
      1. Multi-agent systems
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Frameworks

Recommendations

Verifying epistemic properties of multi-agent systems via bounded model checking
AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems

We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be ...
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Concurrency Specification and Programming (CS&P'2002), Part 2

We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be ...
Verification of multi-agent systems via bounded model checking
AI'06: Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL^* by incorporating epistemic modalities and obtain a temporal epistemic logic that we call ...

Comments

Information & Contributors

Information

Published In

cover image Fundamenta Informaticae

Fundamenta Informaticae Volume 55, Issue 2

Concurrency specification and programming

August 2002

137 pages

ISSN:0169-2968

Issue’s Table of Contents

Publisher

IOS Press

Netherlands

Publication History

Published: 01 August 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Konur SFisher MSchewe S(2013)Combined model checking for temporal, probabilistic, and real-time logicsTheoretical Computer Science10.5555/2846457.2846510503:C(61-88)Online publication date: 9-Sep-2013
https://dl.acm.org/doi/10.5555/2846457.2846510
Meski APenczek WSzreter MWoźna-Szcześniak BZbrzezny A(2012)Bounded model checking for knowledge and linear timeProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2343896.2344054(1447-1448)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343896.2344054
Jones AKnapik MPenczek WLomuscio A(2012)Group synthesis for parametric temporal-epistemic logicProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 210.5555/2343776.2343855(1107-1114)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343776.2343855
Lomuscio APenczek W(2012)Symbolic model checking for temporal-epistemic logicLogic Programs, Norms and Action10.5555/2340883.2340896(172-195)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.5555/2340883.2340896
Męski APenczek WSzreter MWoźna-Szcześniak BZbrzezny A(2012)Two approaches to bounded model checking for linear time logic with knowledgeProceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications10.1007/978-3-642-30947-2_56(514-523)Online publication date: 25-Jun-2012
https://dl.acm.org/doi/10.1007/978-3-642-30947-2_56
Wozna-Szczesniak BZbrzezny AZbrzezny A(2011)The BMC method for the existential part of RTCTLK and interleaved interpreted systemsProceedings of the 15th Portugese conference on Progress in artificial intelligence10.5555/2051115.2051165(551-565)Online publication date: 10-Oct-2011
https://dl.acm.org/doi/10.5555/2051115.2051165
Wan WBentahar JHamza A(2011)Model checking epistemic and probabilistic properties of multi-agent systemsProceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II10.5555/2025816.2025824(68-78)Online publication date: 28-Jun-2011
https://dl.acm.org/doi/10.5555/2025816.2025824
Lomuscio AQu HRusso F(2010)Automatic data-abstraction in model checking multi-agent systemsProceedings of the 6th international conference on Model checking and artificial intelligence10.5555/2008298.2008302(52-68)Online publication date: 11-Jul-2010
https://dl.acm.org/doi/10.5555/2008298.2008302
El-Menshawy MBentahar JDssouli R(2010)Symbolic model checking commitment protocols using reductionProceedings of the 8th international conference on Declarative agent languages and technologies VIII10.5555/1996758.1996773(185-203)Online publication date: 10-May-2010
https://dl.acm.org/doi/10.5555/1996758.1996773
Zhou CSun BLiu Z(2010)Abstraction for model checking the probabilistic temporal logic of knowledgeProceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I10.5555/1927730.1927764(209-221)Online publication date: 23-Oct-2010
https://dl.acm.org/doi/10.5555/1927730.1927764
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents