Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Reasoning about knowledge and probability
Journal of the ACM (JACM)
Reasoning about knowledge
Reasoning about knowledge: a survey
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
Model checking
Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus
Information and Computation
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
Alternating-time temporal logic
Journal of the ACM (JACM)
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of Multiagent Systems via Unbounded Model Checking
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
Model checking for multivalued logic of knowledge and time
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
On the logic of cooperation and propositional control
Artificial Intelligence
| Hi-index | 0.00 |
In this paper, we present a temporal epistemic logic, called µTEL, which generalizes µ-calculus by introducing knowledge modality and cooperation modality. Similar to µ-calculus, µTEL is a succinct and expressive language. It is showed that temporal modalities such as "always", "sometime" and "until", and knowledge modalities such as "everyone knows" and "common knowledge" can be expressed in such a logic. Furthermore, we study the model checking technique and its complexity. Finally, we use µTEL and its model checking algorithm to study the well-known trains and controller problem.