The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Reasoning about knowledge
Model checking
A machine program for theorem-proving
Communications of the ACM
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Symbolic Model Checking
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
Applying SAT Methods in Unbounded Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Bounded Model Checking for the Universal Fragment of CTL
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
SAT-based Unbounded Model Checking of Timed Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Towards Verification of Java Programs in perICS
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Complexity Issues in Multiagent Logics
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Hi-index | 0.00 |
This paper addresses the problem of verification of temporal epistemic properties of multi-agent systems by means of symbolic model checking. An overview of the technique of bounded model checking for temporal epistemic logic, and an analysis of some limitations of the method are provided. An extension of this technique called unbounded model checking to solve these limitations is explored. Similarities and differences of the two methods are explicitly exemplified by the analysis of a scenario in the two formalisms.