The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
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
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Model checking vs. theorem proving: a manifesto
Artificial intelligence and mathematical theory of computation
Infinite trees and automaton-definable relations over &ohgr;-words
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Reasoning about knowledge
Common knowledge and update in finite environments
Information and Computation
Model checking
Synthesis from Knowledge-Based Specifications (Extended Abstract)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Implementing knowledge-based programs
TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Distributed Computing
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Model Checking Knowledge and Linear Time: PSPACE Cases
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Proving Epistemic and Temporal Properties from Knowledge Based Programs
SBIA '08 Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
Declarative Agent Languages and Technologies VI
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
Computational Logic in Multi-Agent Systems
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A proof system for time-dependent multi-agents
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Logic of information flow on communication channels
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
Symbolic model checking of probabilistic knowledge
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Combined logics of knowledge, time, and actions for reasoning about multi-agent systems
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Model checking temporal logics of knowledge and its application in security verification
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Model checking for PRS-like agents
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Verifying multi-agent systems via unbounded model checking
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
Towards symbolic model checking for multi-agent systems via OBDD's
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
The complexity of model checking concurrent programs against CTLK specifications
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Model checking information flow in reactive systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Symbolic model checking for temporal-epistemic logic
Logic Programs, Norms and Action
Exponential acceleration of model checking for perfect recall systems
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Two approaches to bounded model checking for linear time logic with knowledge
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Reasoning about time-dependent multi-agents: foundations of theorem proving and model checking
Transactions on Compuational Collective Intelligence VI
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
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Towards SAT-based BMC for LTLK over Interleaved Interpreted Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Programming and Computing Software
International Journal of Intelligent Information Technologies
A logic of probabilistic knowledge and strategy
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Diagnosability in concurrent probabilistic systems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Combined model checking for temporal, probabilistic, and real-time logics
Theoretical Computer Science
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
This paper studies model checking for the modal logic of knowledge and linear time in distributed systems with perfect recall. It is shown that this problem (1) is undecidable for a language with operators for until and common knowledge, (2) is PSPACE-complete for a language with common knowledge but without until, (3) has nonelementary upper and lower bounds for a language with until but without common knowledge.M odel checking bounded knowledge depth formulae of the last of these languages is considered in greater detail, and an automata-theoretic decision procedure is developed for this problem, that yields a more precise complexity characterization.