Quantitative Reachability Stackelberg-Pareto Synthesis Is NEXPTIME-Complete. - Thomas Brihaye; Véronique Bruyère; Gaspard Reghem (RP, 2023)

Branching Bisimilarity for Processes with Time-Outs. - Gaspard Reghem; Rob J. van Glabbeek (CONCUR, 2024)

Concrete Branching Bisimilarity for Processes with Time-outs. - Gaspard Reghem; Rob van Glabbeek (CoRR, 2024)