research
∙
05/18/2023
COOL 2 – A Generic Reasoner for Modal Fixpoint Logics
There is a wide range of modal logics whose semantics goes beyond relati...
share
research
∙
05/04/2023
Symbolic Reactive Synthesis for the Safety and EL-fragment of LTL
We suggest an expressive fragment of LTL for which reactive synthesis ca...
research
∙
12/21/2022
Coalgebraic Satisfiability Checking for Arithmetic μ-Calculi
The coalgebraic μ-calculus provides a generic semantic framework for fix...
research
∙
07/01/2022
A Survey on Satisfiability Checking for the μ-Calculus through Tree Automata
Algorithms for model checking and satisfiability of the modal μ-calculus...
research
∙
10/21/2020
Harnessing LTL With Freeze Quantification
Logics and automata models for languages over infinite alphabets, such a...
research
∙
02/12/2020
NP Reasoning in the Monotone μ-Calculus
Satisfiability checking for monotone modal logic is known to be (only) N...
research
∙
07/16/2019
Computing Nested Fixpoints in Quasipolynomial Time
It is well known that the winning region of a parity game with n nodes a...
research
∙
01/15/2019
Optimal Satisfiability Checking for Arithmetic μ-Calculi
The coalgebraic μ-calculus provides a generic semantic framework for fix...
research
∙
10/24/2017
