2 papers
cs.GT2025
Stackelberg-Pareto Synthesis with Quantitative Reachability Objectives
Thomas Brihaye, Véronique Bruyère, Gaspard Reghem
In this paper, we deepen the study of two-player Stackelberg games played on graphs in which Player announces a strategy and Player , having several objectives, responds rat…
cs.LO2024
Concrete Branching Bisimilarity for Processes with Time-outs
Gaspard Reghem, Rob van Glabbeek
This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs that does not enable eliding of time-out transitions. Multiple equivalent definitions…