| Publication | Date of Publication | Type |
|---|
Foundations of runtime monitoring through the lens of concurrency theory
Bulletin of the European Association for Theoretical Computer Science EATCS | 2026-05-12 | Paper |
| The best a monitor can do | 2026-03-23 | Paper |
| On the succinctness of alternating parity good-for-games automata | 2026-03-23 | Paper |
| History-determinism vs fair simulation | 2026-02-10 | Paper |
History-deterministic Parikh automata
ACM Transactions on Computational Logic | 2025-08-22 | Paper |
| History-deterministic Parikh automata | 2025-06-26 | Paper |
History-deterministic timed automata
Logical Methods in Computer Science | 2024-11-12 | Paper |
| A brief history of history-determinism (invited talk) | 2024-10-08 | Paper |
| Parikh automata over Infinite words | 2024-09-12 | Paper |
| History-deterministic timed automata | 2024-08-13 | Paper |
From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
TheoretiCS | 2024-07-03 | Paper |
| On the size of good-for-games Rabin automata and its link with the memory in Muller games | 2024-06-24 | Paper |
| An Operational Guide to Monitorability | 2024-03-14 | Paper |
Testing equivalence vs. runtime monitoring
Models, Languages, and Tools for Concurrent and Distributed Programming | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7799616 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
On the translation of automata to linear temporal logic
Lecture Notes in Computer Science | 2024-01-23 | Paper |
Token games and history-deterministic quantitative automata
Lecture Notes in Computer Science | 2024-01-23 | Paper |
A bit of nondeterminism makes pushdown automata expressive and succinct
Logical Methods in Computer Science | 2024-01-16 | Paper |
Token games and history-deterministic quantitative-automata
Logical Methods in Computer Science | 2024-01-16 | Paper |
On probabilistic monitorability
Lecture Notes in Computer Science | 2023-08-10 | Paper |
| A bit of nondeterminism makes pushdown automata expressive and succinct | 2023-08-08 | Paper |
History-deterministic timed automata are not determinizable
Lecture Notes in Computer Science | 2023-07-21 | Paper |
scientific article; zbMATH DE number 7649927 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7649926 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| On the Way to Alternating Weak Automata | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7471697 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471697 (Why is no real title available?) | 2022-02-09 | Paper |
scientific article; zbMATH DE number 7471692 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471692 (Why is no real title available?) | 2022-02-09 | Paper |
| The descriptive complexity of modal model-checking games | 2021-12-14 | Paper |
The descriptive complexity of modal model-checking games
(available as arXiv preprint) | 2021-12-14 | Paper |
| Disjunctive form and the modal alternation hierarchy | 2021-12-02 | Paper |
Disjunctive form and the modal alternation hierarchy
(available as arXiv preprint) | 2021-12-02 | Paper |
Good-for-games \(\omega \)-pushdown automata
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
scientific article; zbMATH DE number 7215285 (Why is no real title available?)
(available as arXiv preprint) | 2020-06-26 | Paper |
| scientific article; zbMATH DE number 7215285 (Why is no real title available?) | 2020-06-26 | Paper |
| Deciding the first levels of the modal alternation hierarchy by formula construction | 2017-08-31 | Paper |
\(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\)
(available as arXiv preprint) | 2017-08-04 | Paper |
