On the Bisimulation Invariant Fragment of Monadic S1 in the Finite

نویسندگان

  • Anuj Dawar
  • David Janin
چکیده

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

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The monadic theory of finite representations of infinite words

In this paper, we consider existential monadic second-order logic (monadic Σ1) on finite unary graphs, that is finite graphs with functional edge relation. These can be seen as finite encodings of ultimately periodic words. We show that, on these graphs, the bisimulation invariant fragment of monadic Σ1 equals the bisimulation invariant fragment of monadic second order logic itself, and that MS...

متن کامل

Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy

As already known [14], the mu-calculus [17] is as expressive as the bisimulation invariant fragment of monadic second order Logic (MSO). In this paper, we relate the expressiveness of levels of the fixpoint alternation depth hierarchy of the mu-calculus (the mu-calculus hierarchy) with the expressiveness of the bisimulation invariant fragment of levels of the monadic quantifiers alternation-dep...

متن کامل

A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus

We provide a characterization theorem, in the style of van Benthem and Janin-Walukiewicz, for the alternation-free fragment of the modal μ-calculus. For this purpose we introduce a variant of standard monadic second-order logic (MSO), which we call well-founded monadic second-order logic (WFMSO). When interpreted in a tree model, the second-order quantifiers of WFMSO range over subsets of conve...

متن کامل

Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree

In this thesis we study the expressive power of variants of monadic second-order logic (MSO) on infinite trees by means of automata. In particular we are interested in weak MSO and well-founded MSO, where the second-order quantifiers range respectively over finite sets and over subsets of well-founded trees. On finitely branching trees, weak and well-founded MSO have the same expressive power a...

متن کامل

Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs

We provide several effective equivalent characterizations of EF (the modal logic of the descendant relation) on arbitrary trees. More specifically, we prove that, for EF-bisimulation invariant properties of trees, being definable by an EF formula, being a Borel set, and being definable in weak monadic second order logic, all coincide. The proof builds upon a known algebraic characterization of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004