research
∙
05/03/2023
History-deterministic Vector Addition Systems
We consider history-determinism, a restricted form of non-determinism, f...
share
research
∙
04/06/2023
History-deterministic Timed Automata
We explore the notion of history-determinism in the context of timed aut...
research
∙
03/29/2023
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder
Temporal logics for the specification of information-flow properties are...
research
∙
03/22/2022
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games
We study countably infinite stochastic 2-player games with reachability ...
research
∙
05/10/2021
HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete
Temporal logics for the specification of information-flow properties are...
research
∙
01/18/2021
Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP
We study stochastic games with energy-parity objectives, which combine q...
research
∙
12/26/2020
Transience in Countable MDPs
The Transience objective is not to visit any state infinitely often. Whi...
research
∙
07/07/2020
Strategy Complexity of Parity Objectives in Countable MDPs
We study countably infinite MDPs with parity objectives. Unlike in finit...
research
∙
12/10/2019
Optimally Resilient Strategies in Pushdown Safety Games
Infinite-duration games with disturbances extend the classical framework...
research
∙
09/13/2019
Controlling a Random Population is EXPTIME-hard
Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in wh...
research
∙
07/02/2019
Timed Basic Parallel Processes
Timed basic parallel processes (TBPP) extend communication-free Petri ne...
research
∙
06/21/2018
