| No. |
Title |
Author |
Year |
| 1 |
History-Deterministic Parikh Automata |
Erlich, Enzo et al. |
2023 |
| 2 |
Parikh Automata over Infinite Words |
Guha, Shibashis et al. |
2022 |
| 3 |
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct |
Guha, Shibashis et al. |
2021 |
| 4 |
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete |
Fortin, Marie et al. |
2021 |
| 5 |
Optimally Resilient Strategies in Pushdown Safety Games |
Neider, Daniel et al. |
2020 |
| 6 |
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas |
Mascle, Corto et al. |
2020 |
| 7 |
Parity Games with Weights |
Schewe, Sven et al. |
2018 |
| 8 |
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems |
Hague, Matthew et al. |
2018 |
| 9 |
Synthesizing Optimally Resilient Controllers |
Neider, Daniel et al. |
2018 |
| 10 |
Team Semantics for the Specification and Verification of Hyperproperties |
Krebs, Andreas et al. |
2018 |
| 11 |
The First-Order Logic of Hyperproperties |
Finkbeiner, Bernd et al. |
2017 |
| 12 |
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs |
Weinert, Alexander et al. |
2016 |
| 13 |
Prompt Delay |
Klein, Felix et al. |
2016 |
| 14 |
Visibly Linear Dynamic Logic |
Weinert, Alexander et al. |
2016 |
| 15 |
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead |
Klein, Felix et al. |
2015 |
| 16 |
The Complexity of Counting Models of Linear-time Temporal Logic |
Torfah, Hazem et al. |
2014 |
| 17 |
Cost-Parity and Cost-Streett Games |
Fijalkow, Nathanael et al. |
2012 |
| 18 |
Degrees of Lookahead in Context-free Infinite Games |
Fridman, Wladimir et al. |
2011 |
