We investigate the expressive power of existential monadic second-order logic (monadic Σ1) on finite transition systems. In particular, we look at its power to express properties that are invariant under forms of bisimulation and compare these to properties expressible in corresponding fixed-point modal calculi. We show that on finite unary transition systems the bisimulation invariant fragment of monadic Σ1 is equivalent to bisimulation-invariant monadic second order logic itself or, equivalently, the mu-calculus. These results contrast with the situation on infinite structures. Although we show that these results do not extend directly to the case of arbitrary finite transition systems, we are still able to show that the situation there contrasts sharply with the case of arbitrary structures. In particular, we establish a partial expressiveness result by means of tree-like tiling systems that does not hold on infinite structures. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Dawar, A., & Janin, D. (2004). On the bisimulation invariant fragment of monadic Σ1 in the finite. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3328, 224–236. https://doi.org/10.1007/978-3-540-30538-5_19
Mendeley helps you to discover research relevant for your work.