5 papers · 1 filter
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
Florian Bruse, Martin Lange
We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invarian…
Characterizing the Exponential-Space Hierarchy Via Partial Fixpoints
Florian Bruse, David Kronenberger, Martin Lange
The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results i…
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes
Florian Bruse, David Kronenberger, Martin Lange
Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi…
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics
Eric Alsmann, Florian Bruse, Martin Lange
We investigate the expressive power of the two main kinds of program logics for complex, non-regular program properties found in the literature: those extending propositional dynam…
Local Higher-Order Fixpoint Iteration
Florian Bruse, Jörg Kreiker, Martin Lange +1
Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in…