Cited By
View all- Chen TPrimiero GRaimondi FRungta N(2016)A Computationally Grounded, Weighted Doxastic LogicStudia Logica10.1007/s11225-015-9621-4104:4(679-703)Online publication date: 1-Aug-2016
Model checking degrees of belief in a system of agents
Pages 133 - 140
Abstract
In this paper we present a unified framework to model and verify degrees of belief in a system of agents. In particular, we describe an extension of the temporal-epistemic logic CTLK and we introduce a semantics based on interpreted systems for this extension. In this way, degrees of beliefs do not need to be provided externally, but can be derived automatically from the possible executions of the system, thereby providing a computationally grounded formalism. We leverage the semantics to (a) construct a model checking algorithm, (b) investigate its complexity, (c) provide a Java implementation of the model checking algorithm, and (d) evaluate our approach using the standard benchmark of the dining cryptographers. Finally, we provide a detailed case study: using our framework and our implementation, we assess and verify the situational awareness of the pilot of Air France 447 flying in off-nominal conditions.
References
[1]
A. Agogino and G. Brat. Statistical analysis of flight procedures. Technical report, NASA Ames Research Center, Moffett Field, Mountain View (CA), 2011.
[2]
Fahiem Bacchus, Adam J. Grove, Joseph Y. Halpern, and Daphne Koller. From statistical knowledge bases to degrees of belief. Artificial Intelligence, 87:75--143, 1996.
[3]
Rafael H. Bordini, Jomi Fred Hübner, and Michael Wooldridge. Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology). John Wiley & Sons, 2007.
[4]
David Chaum. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1:65--75, 1988.
[5]
T. Chen, V. Forejt, M. Kwiatkowska, D. Parker, and A. Simaitis. PRISM-games: A model checker for stochastic multi-player games. In N. Piterman and S. Smolka, editors, Proc. 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'13), volume 7795 of LNCS, pages 185--191. Springer, 2013.
[6]
Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, David Parker, and Aistis Simaitis. Automatic verification of competitive stochastic systems. Formal Methods in System Design, 43(1):61--92, 2013.
[7]
Edmund M Clarke, Orna Grumberg, and Doron A Peled. Model checking. MIT press, 1999.
[8]
Nivea de Carvalho Ferreira, Michael Fisher, and Wiebe Van Der Hoek. Specifying and reasoning about uncertain agents. International Journal of Approximate Reasoning, 49(1):35--51, 2008.
[9]
Louise A Dennis, Michael Fisher, Matthew P Webster, and Rafael H Bordini. Model checking agent programming languages. Automated Software Engineering, 19(1):5--63, 2012.
[10]
Ronald Fagin, Joseph Y Halpern, Yoram Moses, and Moshe Y Vardi. Reasoning about knowledge. MIT press Cambridge, 1995.
[11]
Han Tin French, Elizabeth Clarke, Diane Pomeroy, Melanie Seymour, and C Richard Clark. Psycho-physiological measures of situation awareness. Decision Making in Complex Environments, page 291, 2007.
[12]
Nir Friedman and Joseph Y Halpern. Plausibility measures and default reasoning. Journal of the ACM, 48(4):648--685, 2001.
[13]
Peter Gammie and Ron Van Der Meyden. MCK: Model checking the logic of knowledge. In Computer Aided Verification, pages 479--483. Springer, 2004.
[14]
Joseph Y Halpern. Reasoning about uncertainty. The MIT Press, 2003.
[15]
Joseph Y. Halpern and Samantha Leung. Weighted sets of probabilities and minimaxweighted expected regret: New approaches for representing uncertainty and making decisions. In Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, Catalina Island, CA, USA, August 14--18, 2012, pages 336--345, 2012.
[16]
Xiaowei Huang and Cheng Luo. A logic of probabilistic knowledge and strategy. In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, Saint Paul, MN, USA, May 6--10, 2013, pages 845--852, 2013.
[17]
Josie Hunter, Franco Raimondi, Neha Rungta, and Richard Stocker. A synergistic and extensible framework for multi-agent system verification. In International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, Saint Paul, MN, USA, pages 869--876, 2013.
[18]
Marta Kwiatkowska, Gethin Norman, and David Parker. Prism 4.0: Verification of probabilistic real-time systems. In Ganesh Gopalakrishnan an Shaz Qadeer, editors, Computer Aided Verification, volume 6806 of Lecture Notes in Computer Science, pages 585--591. Springer Berlin Heidelberg, 2011.
[19]
Alessio Lomuscio, Hongyang Qu, and Franco Raimondi. Mcmas: A model checker for the verification of multi-agent systems. In Ahmed Bouajjani and Oded Maler, editors, Computer Aided Verification, volume 5643 of Lecture Notes in Computer Science, pages 682--688. Springer Berlin Heidelberg, 2009.
[20]
Alessio Lomuscio and Franco Raimondi. The complexity of model checking concurrent programs against CTLK specifications. In Declarative Agent Languages and Technologies IV, pages 29--42. Springer, 2006.
[21]
Terence Parr. The Definitive ANTLR Reference: Building Domain-Specific Languages. Pragmatic Bookshelf, 2007.
[22]
Matthew Richardson and Pedro Domingos. Markov logic networks. Machine learning, 62(1--2):107--136, 2006.
[23]
Glenn Shafer. A mathematical theory of evidence, volume 1. Princeton university press Princeton, 1976.
[24]
Michael Wooldridge. Computationally grounded theories of agency. In Proceedings of ICMAS, International Conference of Multi-Agent Systems, pages 13--20. IEEE Press, 2000.
Index Terms
- Model checking degrees of belief in a system of agents
Recommendations
Model checking epistemic-probabilistic logic using probabilistic interpreted systems
Model checking is a formal technique widely used to verify security and communication protocols in epistemic multi-agent systems against given properties. Qualitative properties such as safety and liveliness have been widely analyzed in the literature. ...
A modal logic framework for multi-agent belief fusion
This article provides a modal logic framework for reasoning about multi-agent belief and its fusion. We propose logics for reasoning about cautiously merged agent beliefs that have different degrees of reliability. These logics are obtained by combining ...
Symbolic Model Checking Multi-Agent Systems against CTL*K Specifications
AAMAS '17: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent SystemsWe introduce a technique for model checking multi-agent systems against temporal-epistemic specifications expressed in the logic CTL. We present an algorithm for the verification of explicit models and use this to show that the problem is PSPACE-...
Comments
Information & Contributors
Information
Published In
May 2014
1774 pages
ISBN:9781450327381
- General Chairs:
- Ana Bazzan,
- Michael Huhns,
- Program Chairs:
- Alessio Lomuscio,
- Paul Scerri
Sponsors
- IFAAMAS
In-Cooperation
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 05 May 2014
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
AAMAS '14
Sponsor:
AAMAS '14: International conference on Autonomous Agents and Multi-Agent Systems
May 5 - 9, 2014
Paris, France
Acceptance Rates
AAMAS '14 Paper Acceptance Rate 169 of 709 submissions, 24%;
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 88Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 27 Jan 2025
Other Metrics
Citations
Cited By
View all- Chen TPrimiero GRaimondi FRungta N(2016)A Computationally Grounded, Weighted Doxastic LogicStudia Logica10.1007/s11225-015-9621-4104:4(679-703)Online publication date: 1-Aug-2016
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