TY - JOUR
T1 - Counting on CTL*
T2 - On the expressive power of monadic path logic
AU - Moller, Faron
AU - Rabinovich, Alexander
PY - 2003/7/1
Y1 - 2003/7/1
N2 - Monadic second-order logic (MSOL) provides a general framework for expressing properties of reactive systems as modelled by trees. Monadic path logic (MPL) is obtained by restricting second-order quantification to paths reflecting computation sequences. In this paper we show that the expressive power of MPL over trees coincides with the usual branching time logic CTL* embellished with a simple form of counting. As a corollary, we derive an earlier result that CTL* coincides with the bisimulation-invariant properties of MPL. In order to prove the main result, we first prove a new Composition Theorem for trees.
AB - Monadic second-order logic (MSOL) provides a general framework for expressing properties of reactive systems as modelled by trees. Monadic path logic (MPL) is obtained by restricting second-order quantification to paths reflecting computation sequences. In this paper we show that the expressive power of MPL over trees coincides with the usual branching time logic CTL* embellished with a simple form of counting. As a corollary, we derive an earlier result that CTL* coincides with the bisimulation-invariant properties of MPL. In order to prove the main result, we first prove a new Composition Theorem for trees.
UR - http://www.scopus.com/inward/record.url?scp=0038127220&partnerID=8YFLogxK
U2 - 10.1016/S0890-5401(03)00104-4
DO - 10.1016/S0890-5401(03)00104-4
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0038127220
SN - 0890-5401
VL - 184
SP - 147
EP - 159
JO - Information and Computation
JF - Information and Computation
IS - 1
ER -