On the expressive power of CTL

Faron Moller, Alexander Rabinovich

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show that the expressive power of the branching time logic CTL* coincides with that of the class of bisimulation invariant properties expressible in so-called monadic path logic: monadic second order logic in which set quantification is restricted to paths. In order to prove this result, we first prove a new Composition Theorem for trees. This approach is adapted from the approach of Hafer and Thomas in their proof that CTL* coincides with the whole of monadic path logic over the class of full binary trees.

Original languageEnglish
Title of host publicationProceedings - Symposium on Logic in Computer Science
PublisherIEEE
Pages360-368
Number of pages9
ISBN (Print)0780357701
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99 - Trento, Italy
Duration: 2 Jul 19995 Jul 1999

Conference

ConferenceProceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99
CityTrento, Italy
Period2/07/995/07/99

Fingerprint

Dive into the research topics of 'On the expressive power of CTL'. Together they form a unique fingerprint.

Cite this