![]() ![]() | Bruyère, V., Grandmont, C., & Raskin, J.-F. (29 August 2024). As Soon as Possible but Rationally. International Conference on Concurrency Theory (CONCUR), 311, 14:1--14:20. doi:10.4230/LIPIcs.CONCUR.2024.14 ![]() |
![]() ![]() | Grandmont, C. (10 December 2024). Introduction aux Jeux sur Graphe à Préférence Automatique [Paper presentation]. Séminaire Jeunes, Mons, Belgium. |
![]() ![]() | Grandmont, C. (21 October 2024). Automatic Relations: their Properties and Beyond [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium. |
![]() ![]() | Grandmont, C. (19 September 2024). As Soon as Possible but Rationally: Rational Synthesis for Reachability on Weighted Graphs [Paper presentation]. Highlights of Logic, Games and Automata, Bordeaux, France. ![]() |
![]() ![]() | Grandmont, C. (10 September 2024). As Soon as Possible but Rationally [Paper presentation]. CONCUR: International Conference on Concurrency Theory, Calgary, Canada. ![]() |
![]() ![]() | Bruyère, V., Grandmont, C., & Raskin, J.-F. (29 August 2024). As Soon as Possible but Rationally. International Conference on Concurrency Theory (CONCUR), 311, 14:1--14:20. doi:10.4230/LIPIcs.CONCUR.2024.14 ![]() |
![]() ![]() | Grandmont, C. (26 April 2024). As Soon as Possible but Rationally [Paper presentation]. WG Data, Automata, Algebra, & Logic Days (Journées du GT DAAL), Rennes, France. ![]() |
![]() ![]() | Grandmont, C. (15 March 2024). As Soon as Possible but Rationally [Paper presentation]. Centre Fédéré en Vérification (CFV), Brussels, Belgium. |
![]() ![]() | Grandmont, C. (11 March 2024). Safety Combination and Parikh Automata applied to the Pareto Rational Synthesis [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium. |
![]() ![]() | Grandmont, C. (23 October 2023). Rational Synthesis on Reachability Objectives through Tree Automata [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium. |