Bisimulation Invariant Monadic-Second Order Logic in the Finite

05/16/2019
by   Achim Blumensath, et al.
0

We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the modal mu-calculus. Using these characterisations we prove for some simple classes of transition systems that this is indeed the case. In particular, we show that, over the class of all finite transition systems with Cantor-Bendixson rank at most k, bisimulation-invariant MSO coincides with L_mu.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2020

Successor-Invariant First-Order Logic on Classes of Bounded Degree

We study the expressive power of successor-invariant first-order logic, ...
research
09/10/2018

The Power of the Weak

A landmark result in the study of logics for formal verification is Jani...
research
09/21/2022

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

Otto's Theorem characterises the bisimulation-invariant PTIME queries ov...
research
04/17/2023

About the Expressive Power and Complexity of Order-Invariance with Two Variables

Order-invariant first-order logic is an extension of first-order logic (...
research
04/16/2018

Expressivity within second-order transitive-closure logic

Second-order transitive-closure logic, SO(TC), is an expressive declarat...
research
06/29/2019

Recursive axiomatizations from separation properties

We define a fragment of monadic infinitary second-order logic correspond...
research
04/14/2022

A Logic for Paraconsistent Transition Systems

Modelling complex information systems often entails the need for dealing...

Please sign up or login with your details

Forgot password? Click here to reset