Abstraction for model checking the probabilistic temporal logic of knowledge

Authors:
Conghua Zhou;Bo Sun;Zhifeng Liu
Affiliations:
School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, Jiangsu Province, China;School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, Jiangsu Province, China;School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, Jiangsu Province, China
Venue:
AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
Year:
2010

Citing 7
Cited 0

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying epistemic properties of multi-agent systems via bounded model checking

Fundamenta Informaticae - Concurrency specification and programming
Model Checking Temporal Logics of Knowledge Via OBDDs1

The Computer Journal
Abstractions of Multi-agent Systems

CEEMAS '07 Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V
Abstraction in model checking multi-agent systems

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Model checking for epistemic and temporal properties of uncertain agents

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Probabilistic temporal logics of knowledge have been used to specify multi-agent systems. In this paper, we introduce a probabilistic temporal logic of knowledge called PTLK for expressing time, knowledge, and probability in multi-agent systems. Then, in order to overcome the state explosion in model checking PTLK we propose an abstraction procedure for model checking PTLK. The rough idea of the abstraction approach is to partition the state space into several equivalence classes which consist of the set of abstract states. The probability distribution between abstract states is defined as an interval for computing the approximation of the concrete system. Finally, the model checking algorithm in PTLK is developed.