| Publication | Date of Publication | Type |
|---|
| Expectation in stochastic games with prefix-independent objectives | 2026-08-05 | Paper |
PAC statistical model checking of mean payoff in discrete- and continuous-time MDP
Formal Methods in System Design | 2025-08-25 | Paper |
History-deterministic Parikh automata
ACM Transactions on Computational Logic | 2025-08-22 | Paper |
Stochastic window mean-payoff games
Logical Methods in Computer Science | 2025-07-11 | Paper |
| History-deterministic Parikh automata | 2025-06-26 | Paper |
| A game of pawns | 2025-06-26 | Paper |
A game of pawns
Logical Methods in Computer Science | 2025-05-06 | Paper |
| Scalable learning of one-counter automata via state-merging algorithms | 2025-01-01 | Paper |
| Stochastic window mean-payoff games | 2024-10-30 | Paper |
| Parikh automata over Infinite words | 2024-09-12 | Paper |
| Strategy synthesis for global window PCTL | 2024-06-24 | Paper |
A bit of nondeterminism makes pushdown automata expressive and succinct
Logical Methods in Computer Science | 2024-01-16 | Paper |
Set augmented finite automata over infinite alphabets
Developments in Language Theory | 2023-11-16 | Paper |
scientific article; zbMATH DE number 7730611 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-21 | Paper |
| A bit of nondeterminism makes pushdown automata expressive and succinct | 2023-08-08 | Paper |
scientific article; zbMATH DE number 7650329 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Two-Way Parikh Automata
(available as arXiv preprint) | 2023-02-03 | Paper |
Timed network games
Information and Computation | 2023-01-12 | Paper |
| PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP | 2022-12-07 | Paper |
| Safe and optimal scheduling for hard and soft tasks | 2022-07-21 | Paper |
Safe learning for near-optimal scheduling
(available as arXiv preprint) | 2022-03-24 | Paper |
Timed network games with clocks
(available as arXiv preprint) | 2021-08-04 | Paper |
A unifying approach to decide relations for timed automata and their game characterization
(available as arXiv preprint) | 2021-06-09 | Paper |
| A unifying approach to decide relations for timed automata and their game characterization | 2021-06-09 | Paper |
| Timed vacuity | 2021-05-04 | Paper |
Mixing probabilistic and non-probabilistic objectives in Markov decision processes
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Timed network games | 2020-05-26 | Paper |
| Expected reachability-price games | 2020-05-05 | Paper |
An abstraction-refinement methodology for reasoning about network games
Games | 2018-12-10 | Paper |
scientific article; zbMATH DE number 6862072 (Why is no real title available?)
(available as arXiv preprint) | 2018-04-19 | Paper |
| Adding dense-timed stack to integer reset timed automata | 2017-12-20 | Paper |
Revisiting robustness in priced timed games
(available as arXiv preprint) | 2017-07-13 | Paper |
Reducing clocks in timed automata while preserving bisimulation
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
