research
∙
04/29/2023
Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games
We improve the complexity of solving parity games (with priorities in ve...
share
research
∙
04/24/2023
The Probabilistic Rabin Tree Theorem
The Rabin tree theorem yields an algorithm to solve the satisfiability p...
research
∙
04/23/2022
Unboundedness for Recursion Schemes: A Simpler Type System
Decidability of the problems of unboundedness and simultaneous unbounded...
research
∙
05/05/2021
Higher-Order Model Checking Step by Step
We show a new simple algorithm that solves the model-checking problem fo...
research
∙
04/20/2021
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
Zielonka's classic recursive algorithm for solving parity games is perha...
research
∙
05/13/2020
Bisimulation Finiteness of Pushdown Systems Is Elementary
We show that in case a pushdown system is bisimulation equivalent to a f...
research
∙
05/05/2020
Compositionality of the MSO+U Logic
We prove that the MSO+U logic is compositional in the following sense: w...
research
∙
04/23/2019
Intersection Types for Unboundedness Problems
Intersection types have been originally developed as an extension of sim...
research
∙
10/10/2018
Recursion Schemes, the MSO Logic, and the U quantifier
We study the model-checking problem for recursion schemes: does the tree...
research
∙
07/27/2018
