R-generability, and definability in branching time logics
- 3 April 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 41 (5) , 281-287
- https://doi.org/10.1016/0020-0190(92)90173-s
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Computation tree logic and regular ω-languagesPublished by Springer Nature ,1989
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- The power of the future perfect in program logicsInformation and Control, 1985
- Yet another process logicPublished by Springer Nature ,1984
- Alternative semantics for temporal logicsTheoretical Computer Science, 1983
- Process logic: Expressiveness, decidability, completenessJournal of Computer and System Sciences, 1982