Benjamin Monmege
4
Documents
Publications
- 4
- 3
- 1
- 1
- 1
- 1
- 1
- 1
|
Reaching Your Goal Optimally by Playing at Random with No Memory31st International Conference on Concurrency Theory (CONCUR 2020), 2020, Vienna, Austria. ⟨10.4230/LIPIcs.CONCUR.2020.26⟩
Communication dans un congrès
hal-02925540v1
|
|
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic ApproachCAV 2019 - 31st International Conference on Computer Aided Verification, Jul 2019, New-York, United States. pp.572-590, ⟨10.1007/978-3-030-25540-4_33⟩
Communication dans un congrès
hal-02264083v1
|
|
Symbolic Approximation of Weighted Timed Games38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.28⟩
Communication dans un congrès
hal-02014051v1
|
|
Optimal Reachability in Divergent Weighted Timed Games20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Apr 2017, Uppsala, Sweden. pp.162-178, ⟨10.1007/978-3-662-54458-7_10⟩
Communication dans un congrès
hal-01522546v1
|