| Publication | Date of Publication | Type |
|---|
An optimal pastification algorithm for \(\mathsf{LTL} \lbrack \mathsf{X}, \mathsf{F} \rbrack\) and \(\mathsf{LTL} \lbrack \mathsf{X}, \mathsf{G} \rbrack \)
Artificial Intelligence | 2026-07-24 | Paper |
| Synthesis of timeline-based planning strategies avoiding determinization | 2025-08-19 | Paper |
Succinctness issues for \(\textsf{LTL}_{\textsf{f}}\) and safety and cosafety fragments of \textsf{LTL}
Information and Computation | 2025-01-31 | Paper |
Extended bounded response LTL: a new safety fragment for efficient reactive synthesis
Formal Methods in System Design | 2025-01-13 | Paper |
| Expressiveness of extended bounded response \textsf{LTL} | 2024-12-06 | Paper |
SAT meets tableaux for linear temporal logic satisfiability
Journal of Automated Reasoning | 2024-09-27 | Paper |
Controller synthesis for timeline-based games
Logical Methods in Computer Science | 2024-09-04 | Paper |
| Controller synthesis for timeline-based games | 2024-02-08 | Paper |
Controller synthesis for timeline-based games
(available as arXiv preprint) | 2024-02-08 | Paper |
A first-order logic characterisation of safety and co-safety languages
Lecture Notes in Computer Science | 2024-01-23 | Paper |
| Complexity of qualitative timeline-based planning | 2023-11-02 | Paper |
| Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker | 2023-10-02 | Paper |
A first-order logic characterization of safety and co-safety languages
Logical Methods in Computer Science | 2023-08-26 | Paper |
Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis
Software Engineering and Formal Methods | 2023-05-26 | Paper |
\(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\)
Information Processing Letters | 2022-10-28 | Paper |
A game-theoretic approach to timeline-based planning with uncertainty
(available as arXiv preprint) | 2022-05-28 | Paper |
Decidability and complexity of action-based temporal planning over dense time
Artificial Intelligence | 2022-04-11 | Paper |
One-pass and tree-shaped tableau systems for \(\mathrm{TPTL}\) and \(\mathrm{TPTL}_b+\mathrm{Past}\)
(available as arXiv preprint) | 2021-12-17 | Paper |
| One-pass and tree-shaped tableau systems for \(\mathrm{TPTL}\) and \(\mathrm{TPTL}_b+\mathrm{Past}\) | 2021-12-17 | Paper |
One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
Information and Computation | 2021-06-03 | Paper |
| A SAT-based encoding of the one-pass and tree-shaped tableau system for LTL | 2020-05-14 | Paper |
On timeline-based games and their complexity
Theoretical Computer Science | 2020-04-06 | Paper |
A one-pass tree-shaped tableau for LTL+past
EPiC Series in Computing | 2019-01-10 | Paper |
Average linear time and compressed space construction of the Burrows-Wheeler transform
Language and Automata Theory and Applications | 2016-04-08 | Paper |
