Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Reasoning about knowledge
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Common knowledge and update in finite environments
Information and Computation
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic Model Checking
Knowledge and the logic of local propositions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The interpreted system model of knowledge, belief, desire and intention
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Observation-based model for BDI-agents
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Computationally grounded model of BDI-agents
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Symbolic model checking temporal logics of knowledge in multi-agent system via extended Mu-calculus
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Symbolic model checking the knowledge in Herbivore protocol
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
A complete first-order temporal BDI logic for forest multi-agent systems
Knowledge-Based Systems
Formal analysis and improvement of the state transition model for intrusion tolerant system
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Observation-Based logic of knowledge, belief, desire and intention
KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
Verification of multi-agent systems via bounded model checking
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
| Hi-index | 0.00 |
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been given to temporal logics of knowledge, although such logics have been proven to be very useful in the specifications of protocols for distributed systems. In this paper, we address ourselves to the model checking problem for a temporal logic of knowledge (Halpern and Vardi's logic of C K Ln). Based on the semantics of interpreted systems with local propositions, we develop an approach to symbolic C K Ln model checking via OBDDs. In our approach to model checking specifications involving agents' knowledge, the knowledge modalities are eliminated via quantifiers over agents' non-observable variables.