The complexity of reasoning about knowledge and time. I. Lower bounds
- 1 February 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 38 (1) , 195-237
- https://doi.org/10.1016/0022-0000(89)90039-1
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Linear and branching structures in the semantics and logics of reactive systemsPublished by Springer Nature ,2005
- Using Reasoning About Knowledge to Analyze Distributed SystemsAnnual Review of Computer Science, 1987
- How processes learnDistributed Computing, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- 3rd ACM symposium on principles of distributed computingComputer Networks and ISDN Systems, 1985
- Synthesis of Communicating Processes from Temporal Logic SpecificationsACM Transactions on Programming Languages and Systems, 1984
- The propositional dynamic logic of deterministic, well-structured programsTheoretical Computer Science, 1983
- Alternative semantics for temporal logicsTheoretical Computer Science, 1983
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982
- AlternationJournal of the ACM, 1981