Automata-theoretic techniques for modal logics of programs
- 1 April 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 32 (2) , 183-221
- https://doi.org/10.1016/0022-0000(86)90026-7
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Decision procedures and expressiveness in the temporal logic of branching timeJournal of Computer and System Sciences, 1985
- Looping vs. repeating in dynamic logicInformation and Control, 1982
- Deterministic propositional dynamic logic: Finite models, complexity, and completenessJournal of Computer and System Sciences, 1982
- Propositional dynamic logic of looping and converse is elementarily decidableInformation and Control, 1982
- An elementary proof of the completeness of PDLTheoretical Computer Science, 1981
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- A near-optimal method for reasoning about actionJournal of Computer and System Sciences, 1980
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970