On the expressive power of CTL

Faron Moller; Alexander Rabinovich

On the expressive power of CTL

Faron Moller^*
, Alexander Rabinovich

^*Corresponding author for this work

Uppsala University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

41 Scopus citations

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 language	English
Title of host publication	Proceedings - Symposium on Logic in Computer Science
Publisher	IEEE
Pages	360-368
Number of pages	9
ISBN (Print)	0780357701
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99 - Trento, Italy Duration: 2 Jul 1999 → 5 Jul 1999

Conference

Conference	Proceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99
City	Trento, Italy
Period	2/07/99 → 5/07/99

Cite this

@inproceedings{728581a551dd4860ba1bfb6eb432a516,

title = "On the expressive power of CTL",

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.",

author = "Faron Moller and Alexander Rabinovich",

year = "1999",

language = "אנגלית",

isbn = "0780357701",

pages = "360--368",

booktitle = "Proceedings - Symposium on Logic in Computer Science",

publisher = "IEEE",

note = "Proceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99 ; Conference date: 02-07-1999 Through 05-07-1999",

}

TY - GEN

T1 - On the expressive power of CTL

AU - Moller, Faron

AU - Rabinovich, Alexander

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0032597504

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0032597504

SN - 0780357701

SP - 360

EP - 368

BT - Proceedings - Symposium on Logic in Computer Science

PB - IEEE

T2 - Proceedings of the 1999 14th Symposium on Logic in Computer Science, LICS'99

Y2 - 2 July 1999 through 5 July 1999

ER -

On the expressive power of CTL

Abstract

Conference

Other files and links

Fingerprint

Cite this