Abstract
We investigate the expressive power of linear-time and branching-time temporal logics as fragments of the logic CTL*. We give a simple characterization of those CTL* formulas that can be expressed in linear-time logic. We also give a simple method for showing that certain CTL* formulas cannot be expressed in the branching-time logic CTL. Both results are illustrated with examples.
Author supplied keywords
Cite
CITATION STYLE
Clarke, E. M., & Draghicescu, I. A. (1989). Expressibility results for linear-time and branching-time logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 354 LNCS, pp. 428–437). Springer Verlag. https://doi.org/10.1007/BFb0013029
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
