Handbook of theoretical computer science (vol. B)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Reasoning about knowledge
Model checking
Theoretical Computer Science
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
Artificial Intelligence Review
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Reasoning about Uncertainty
Model Checking for Combined Logics with an Application to Mobile Systems
Automated Software Engineering
Verification of Multiagent Systems via Unbounded Model Checking
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Model checking knowledge, strategies, and games in multi-agent systems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Model checking for multivalued logic of knowledge and time
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Bounded model checking for knowledge and real time
Artificial Intelligence
Model Checking Temporal Logics of Knowledge Via OBDDs1
The Computer Journal
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Specifying and reasoning about uncertain agents
International Journal of Approximate Reasoning
Verifying Epistemic Properties of Multi-agent Systems via Action-Based Temporal Logic
CIMCA '08 Proceedings of the 2008 International Conference on Computational Intelligence for Modelling Control & Automation
Strict Divergence for Probabilistic Timed Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Automatic verification of knowledge and time with NuSMV
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Verification of epistemic properties in probabilistic multi-agent systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
Model checking temporal logics of knowledge and its application in security verification
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Model checking agent programming languages
Automated Software Engineering
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
| Hi-index | 5.23 |
Model checking is a well-established technique for the formal verification of concurrent and distributed systems. In recent years, model checking has been extended and adapted for multi-agent systems, primarily to enable the formal analysis of belief-desire-intention systems. While this has been successful, there is a need for more complex logical frameworks in order to verify realistic multi-agent systems. In particular, probabilistic and real-time aspects, as well as knowledge, belief, goals, etc., are required. However, the development of new model checking tools for complex combinations of logics is both difficult and time consuming. In this article, we show how model checkers for the constituent temporal, probabilistic, and real-time logics can be re-used in a modular way when we consider combined logics involving different dimensions. This avoids the re-implementation of model checking procedures. We define a modular approach, prove its correctness, establish its complexity, and show how it can be used to describe existing combined approaches and define yet-unimplemented combinations. We also demonstrate the feasibility of our approach on a case study.