| No. |
Title |
Author |
Year |
| 1 |
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights |
Monmege, Benjamin et al. |
2022 |
| 2 |
Front Matter, Table of Contents, Preface, Conference Organization |
Berenbrink, Petra et al. |
2022 |
| 3 |
LIPIcs, Volume 219, STACS 2022, Complete Volume |
Berenbrink, Petra et al. |
2022 |
| 4 |
Weighted Automata and Expressions over Pre-Rational Monoids |
Baudru, Nicolas et al. |
2022 |
| 5 |
Front Matter, Table of Contents, Preface, Conference Organization |
Bläser, Markus et al. |
2021 |
| 6 |
LIPIcs, Volume 187, STACS 2021, Complete Volume |
Bläser, Markus et al. |
2021 |
| 7 |
Playing Stochastically in Weighted Timed Games to Emulate Memory |
Monmege, Benjamin et al. |
2021 |
| 8 |
Reaching Your Goal Optimally by Playing at Random with No Memory |
Monmege, Benjamin et al. |
2020 |
| 9 |
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata |
Lopez, Théodore et al. |
2019 |
| 10 |
Dynamics on Games: Simulation-Based Techniques and Applications to Routing |
Brihaye, Thomas et al. |
2019 |
| 11 |
Symbolic Approximation of Weighted Timed Games |
Busatto-Gaston, Damien et al. |
2018 |
| 12 |
Timed-Automata-Based Verification of MITL over Signals |
Brihaye, Thomas et al. |
2017 |
| 13 |
Quantitative Games under Failures |
Brihaye, Thomas et al. |
2015 |
| 14 |
Simple Priced Timed Games are not That Simple |
Brihaye, Thomas et al. |
2015 |
| 15 |
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games |
Brihaye, Thomas et al. |
2015 |
