| No. |
Title |
Author |
Year |
| 1 |
History-Deterministic Vector Addition Systems |
Bose, Sougata et al. |
2023 |
| 2 |
History-Deterministic Timed Automata |
Henzinger, Thomas A. et al. |
2022 |
| 3 |
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete |
Fortin, Marie et al. |
2021 |
| 4 |
Transience in Countable MDPs |
Kiefer, Stefan et al. |
2021 |
| 5 |
How to Play in Infinite MDPs (Invited Talk) |
Kiefer, Stefan et al. |
2020 |
| 6 |
Optimally Resilient Strategies in Pushdown Safety Games |
Neider, Daniel et al. |
2020 |
| 7 |
Parametrized Universality Problems for One-Counter Nets |
Almagor, Shaull et al. |
2020 |
| 8 |
Strategy Complexity of Parity Objectives in Countable MDPs |
Kiefer, Stefan et al. |
2020 |
| 9 |
Büchi Objectives in Countable MDPs |
Kiefer, Stefan et al. |
2019 |
| 10 |
Timed Basic Parallel Processes |
Clemente, Lorenzo et al. |
2019 |
| 11 |
Universal Safety for Timed Petri Nets is PSPACE-complete |
Abdulla, Parosh Aziz et al. |
2018 |
| 12 |
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One |
Göller, Stefan et al. |
2016 |
| 13 |
Simulation Over One-counter Nets is PSPACE-Complete |
Hofman, Piotr et al. |
2013 |
