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.
|Title of host publication||Proceedings - Symposium on Logic in Computer Science|
|Number of pages||9|
|State||Published - 1999|
|Event||Proceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99 - Trento, Italy|
Duration: 2 Jul 1999 → 5 Jul 1999
|Conference||Proceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99|
|Period||2/07/99 → 5/07/99|