Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
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
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Common knowledge and update in finite environments
Information and Computation
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
MONA 1.x: New Techniques for WS1S and WS2S
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Reasoning About Knowledge
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
The complexity of model checking concurrent programs against CTLK specifications
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
An ambient agent model for monitoring and analysing dynamics of complex human behaviour
Journal of Ambient Intelligence and Smart Environments
An ambient agent model for monitoring and analysing dynamics of complex human behaviour
Journal of Ambient Intelligence and Smart Environments
| Hi-index | 0.00 |
We show that CTL with knowledge modalities but without common knowledge has an undecidable satisfiability problem in the synchronous perfect recall semantics. We also present an adaptation of the classical model-checking algorithm for CTL that handles knowledge operators.