Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about knowledge
Model checking
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!
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
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Verifying Multi-agent Programs by Model Checking
Autonomous Agents and Multi-Agent Systems
Well-structured model checking of multiagent systems
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Parallel Model Checking for Temporal Epistemic Logic
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Non-elementary speed up for model checking synchronous perfect recall
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
The model checking algorithm for a combination of the computation tree logic (CTL) and the propositional logic of knowledge (PLK) in multiagent systems with perfect recall is revised. The proposed approach is based on data structures that are exponentially smaller than the structures used in the previous version of this checking algorithm. Thus, the time complexity of this algorithm is exponentially reduced.