The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Reasoning about knowledge
Common knowledge and update in finite environments
Information and Computation
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
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
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Bounded model checking knowledge and branching time in synchronous multi-agent systems
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
The complexity of model checking concurrent programs against CTLK specifications
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Unary finite automata vs. arithmetic progressions
Information Processing Letters
On the Computational Complexity of Verifying One-Counter Processes
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Well-structured model checking of multiagent systems
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
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
Exponential acceleration of model checking for perfect recall systems
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Programming and Computing Software
| Hi-index | 0.00 |
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The paper characterizes the complexity of model checking branching time logics of knowledge in finite state systems with respect to the clock semantics.