research
∙
05/07/2023
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism
We study transformations of automata and games using Muller conditions i...
share
research
∙
04/06/2023
History-deterministic Timed Automata
We explore the notion of history-determinism in the context of timed aut...
research
∙
07/15/2022
Parikh Automata over Infinite Words
Parikh automata extend finite automata by counters that can be tested fo...
research
∙
01/25/2022
On the Translation of Automata to Linear Temporal Logic
While the complexity of translating future linear temporal logic (LTL) i...
research
∙
05/06/2021
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
We study the expressiveness and succinctness of good-for-games pushdown ...
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
∙
01/13/2020
Good-for-games ω-Pushdown Automata
We introduce good-for-games ω-pushdown automata (ω-GFG-PDA). These are a...
research
∙
06/03/2019
An Operational Guide to Monitorability
Monitorability delineates what properties can be verified at runtime. Al...
research
∙
04/26/2019
Improving the complexity of Parys' recursive algorithm
Parys has recently proposed a quasi-polynomial version of Zielonka's rec...
research
∙
02/13/2019
The Cost of Monitoring Alone
We compare the succinctness of two monitoring systems for properties of ...
research
∙
02/01/2019
