Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The logic of distributed protocols
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
A logical study of distributed transition systems
Information and Computation
Reasoning about knowledge
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
Linear Time Temporal Logics over Mazurkiewicz Traces
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Local Knowledge Assertions in a Changing World
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Towards Bounded Model Checking for the Universal Fragment of TCTL
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
A Model Checking Algorithm for Multiagent Systems
ATAL '98 Proceedings of the 5th International Workshop on Intelligent Agents V, Agent Theories, Architectures, and Languages
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Model-Checking for a Subclass of Event Structures
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Distributed Computing
| Hi-index | 0.00 |
A model checking algorithm for proving correctness of causal knowledge protocols for multi-agent systems is given. Protocols are specified in an extension of the temporal logic of causal knowledge [18]. The temporal language is interpreted over labelled prime event structures. The epistemic operators correspond to knowledge and goals, whereas the temporal modalities correspond to the immediate causality and causality. The model checking algorithm is translated to the model checking problem for LTL or ACTL. This enables a further translation to the SAT-problem, using the technique of the bounded model checking.