| Publication | Date of Publication | Type |
|---|
Efficient monitoring of timed properties
Formal Methods in System Design | 2026-08-13 | Paper |
| Time for timed monitorability | 2026-08-05 | Paper |
| Prophecies all the way: game-based model-checking for HyperQPTL beyond ^*^* | 2026-08-05 | Paper |
| The complexity of second-order HyperLTL | 2026-06-09 | Paper |
The complexity of HyperQPTL
Information Processing Letters | 2026-04-10 | Paper |
The complexity of second-order HyperLTL
Logical Methods in Computer Science | 2026-03-23 | Paper |
History-deterministic Parikh automata
ACM Transactions on Computational Logic | 2025-08-22 | Paper |
Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking
Acta Informatica | 2025-08-22 | Paper |
| Strategies resilient to delay: games under delayed control vs. delay games | 2025-08-19 | Paper |
| History-deterministic Parikh automata | 2025-06-26 | Paper |
On the existence of reactive strategies resilient to delay
Logical Methods in Computer Science | 2025-03-25 | Paper |
| Limit your consumption! Finding bounds in average-energy games | 2025-02-26 | Paper |
| Weak Muller conditions make delay games hard | 2025-02-03 | Paper |
HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
Logical Methods in Computer Science | 2025-01-31 | Paper |
Robust probabilistic temporal logics
Information Processing Letters | 2025-01-14 | Paper |
| Parikh automata over Infinite words | 2024-09-12 | Paper |
| Robust alternating-time temporal logic | 2024-05-29 | Paper |
Adaptive strategies for rLTL games
Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control | 2024-02-21 | Paper |
A bit of nondeterminism makes pushdown automata expressive and succinct
Logical Methods in Computer Science | 2024-01-16 | Paper |
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.
(available as arXiv preprint) | 2023-08-08 | Paper |
| A bit of nondeterminism makes pushdown automata expressive and succinct | 2023-08-08 | Paper |
From LTL to rLTL monitoring: improved monitorability through robust semantics
Formal Methods in System Design | 2023-06-29 | Paper |
Optimal strategy synthesis for request-response games
RAIRO. Theoretical Informatics and Applications | 2016-01-22 | Paper |
Optimal bounds in parametric LTL games
Theoretical Computer Science | 2014-01-10 | Paper |
| Degrees of lookahead in context-free infinite games | 2012-09-18 | Paper |
Playing Muller games in a hurry
International Journal of Foundations of Computer Science | 2012-08-30 | Paper |
