We study transformations of automata and games using Muller conditions i...
We explore the notion of history-determinism in the context of timed aut...
Parikh automata extend finite automata by counters that can be tested fo...
While the complexity of translating future linear temporal logic (LTL) i...
We study the expressiveness and succinctness of good-for-games pushdown
...
Zielonka's classic recursive algorithm for solving parity games is perha...
We introduce good-for-games ω-pushdown automata (ω-GFG-PDA).
These are a...
Monitorability delineates what properties can be verified at runtime.
Al...
Parys has recently proposed a quasi-polynomial version of Zielonka's
rec...
We compare the succinctness of two monitoring systems for properties of
...
This paper establishes a comprehensive theory of runtime monitorability ...