Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
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
AgentSpeak(L): BDI agents speak out in a logical computable language
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Model checking
Symbolic Model Checking
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
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
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
Model checking for multivalued logic of knowledge and time
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Distributed BDD-based BMC for the verification of multi-agent systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Hi-index | 0.00 |
We present an algorithm for model checking temporal-epistemic properties of multi-agent systems, expressed in the formalism of interpreted systems. We first introduce a technique for the translation of interpreted systems into boolean formulae, and then present a model-checking algorithm based on this translation. The algorithm is based on obdd's, as they offer a compact and efficient representation for boolean formulae.