
Benjamin Monmege
47
Documents
Publications
12
9
8
6
5
5
4
4
4
3
3
3
3
3
3
2
2
2
2
2
2
2
2
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
3
4
2
3
2
1
3
4
4
2
3
6
3
4
1
2
Publications
|
Permissive Equilibria in Multiplayer Reachability Games33rd EACSL Annual conference on Computer Science Logic (CSL 2025), 2025, Amsterdam, France. ⟨10.4230/LIPIcs.CSL.2025.23⟩
Communication dans un congrès
hal-04939923
v1
|
|
A Bargaining-Game Framework for Multi-Party Access Control29th ACM Symposium on Access Control Models and Technologies (SACMAT 2024), 2024, San Antonio, United States. ⟨10.1145/3649158.3657033⟩
Communication dans un congrès
hal-04740615
v1
|
|
Synthesis of Robust Optimal Real-Time Systems49th international symposium on mathematical foundations of computer science (MFCS'24), 2024, Bratislava, Czech Republic. ⟨10.4230/LIPICS.MFCS.2024.74⟩
Communication dans un congrès
hal-04740611
v1
|
|
An Automata Theoretic Characterization of Weighted First-Order LogicInternational Symposium on Automated Technology for Verification and Analysis, 2023, Singapore, Singapore. pp.115-133, ⟨10.1007/978-3-031-45329-8_6⟩
Communication dans un congrès
hal-04281052
v1
|
|
Weighted Automata and Expressions over Pre-Rational Monoids30th EACSL Annual Conference on Computer Science Logic (CSL 2022), Feb 2022, Göttingen, France. ⟨10.4230/LIPIcs.CSL.2022.6⟩
Communication dans un congrès
hal-03545602
v1
|
|
Playing Stochastically in Weighted Timed Games to Emulate Memory48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow (virtual), United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.137⟩
Communication dans un congrès
hal-03282049
v1
|
|
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-02925540
v1
|
|
Dynamics on Games: Simulation-Based Techniques and Applications to Routing39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019), Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.35⟩
Communication dans un congrès
hal-02414987
v1
|
|
Determinisation of Finitely-Ambiguous Copyless Cost Register Automata44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. ⟨10.4230/LIPIcs.MFCS.2019.75⟩
Communication dans un congrès
hal-02268107
v1
|
|
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-02264083
v1
|
|
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-02014051
v1
|
|
Efficient algorithms and tools for MITL model-checking and synthesis23rd International Conference on Engineering of Complex Computer Systems (ICECCS), Dec 2018, Melbourne, Australia
Communication dans un congrès
hal-02014073
v1
|
|
Timed-Automata-Based Verification of MITL over Signals24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, France. pp.7:1--7:19, ⟨10.4230/LIPIcs.TIME.2017.7⟩
Communication dans un congrès
hal-01526986
v1
|
|
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-01522546
v1
|
|
MightyL: A Compositional Translation from MITL to Timed Automata29th International Conference on Computer Aided Verification (CAV'17), Jul 2017, Heidelberg, Germany. pp.421-440, ⟨10.1007/978-3-319-63387-9_21⟩
Communication dans un congrès
hal-01525524
v1
|
|
Efficient Energy Distribution in a Smart Grid using Multi-Player GamesCassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) , Apr 2016, Eindhoven, Netherlands. pp.1 - 12, ⟨10.4204/EPTCS.220.1⟩
Communication dans un congrès
hal-01452611
v1
|
|
Real-time Synthesis is Hard!14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16), Aug 2016, Québec City, Canada. pp.105-120, ⟨10.1007/978-3-319-44878-7_7⟩
Communication dans un congrès
hal-01344684
v1
|
|
Quantitative Games under Failures35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. pp.293-306, ⟨10.4230/LIPIcs.FSTTCS.2015.293⟩
Communication dans un congrès
hal-01273251
v1
|
|
To Reach or not to Reach? Efficient Algorithms for Total-Payoff GamesProceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), Sep 2015, Madrid, Spain. pp.297-310, ⟨10.4230/LIPIcs.CONCUR.2015.297⟩
Communication dans un congrès
hal-01273475
v1
|
|
Simple Priced Timed Games Are Not That SimpleProceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. pp.278-292, ⟨10.4230/LIPIcs.FSTTCS.2015.p⟩
Communication dans un congrès
hal-01452621
v1
|
|
Logical Characterization of Weighted Pebble Walking AutomataCSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603118⟩
Communication dans un congrès
hal-01006125
v1
|
|
Reachability in MDPs: Refining Convergence of Value Iteration8th International Workshop on Reachability Problems (RP'14), Sep 2014, Oxford, United Kingdom. pp.125-137, ⟨10.1007/978-3-319-11439-2_10⟩
Communication dans un congrès
hal-01091122
v2
|
|
Adding Negative Prices to Priced Timed Games25th International Conference on Concurrency Theory (CONCUR'14), Sep 2014, Rome, Italy. pp.560-575, ⟨10.1007/978-3-662-44584-6_38⟩
Communication dans un congrès
hal-01273480
v1
|
|
Weighted Specifications over Nested WordsFoundations of Software Science and Computation Structures (FoSSaCS'13), Mar 2013, Rome, Italy. pp.385-400, ⟨10.1007/978-3-642-37075-5_25⟩
Communication dans un congrès
hal-00909035
v1
|
|
A Fresh Approach to Learning Register AutomataDevelopments in Language Theory, 2013, France. pp.118-130, ⟨10.1007/978-3-642-38771-5_12⟩
Communication dans un congrès
hal-00908998
v1
|
Adding Pebbles to Weighted AutomataProceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), 2012, Porto, Portugal. pp.28-51, ⟨10.1007/978-3-642-31606-7_4⟩
Communication dans un congrès
hal-00776603
v1
|
|
|
A Probabilistic Kleene TheoremAutomated Technology for Verification and Analysis (ATVA'12), Oct 2012, Thiruvananthapuram, India. pp.400-415, ⟨10.1007/978-3-642-33386-6_31⟩
Communication dans un congrès
hal-00909042
v1
|
|
Pebble weighted automata and transitive closure logicsProceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) - Part II, Jul 2010, Bordeaux, France. pp.587-598, ⟨10.1007/978-3-642-14162-1_49⟩
Communication dans un congrès
hal-00608179
v1
|
|
Bounded UnderapproximationsProceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), Jul 2010, Edinburgh, United Kingdom. pp.600-614, ⟨10.1007/978-3-642-14295-6_52⟩
Communication dans un congrès
hal-00608175
v1
|
|
Games on Graphspp.1-491, In press, ⟨10.48550/arXiv.2305.10546⟩
Ouvrages
hal-04273394
v1
|
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)2021
Ouvrages
hal-03518289
v1
|
|
A Fresh Approach to Learning Register Automata2012
Rapport
hal-00743240
v3
|
Weighted Expressions and DFS Tree Automata[Research Report] LSV-11-08, 2011
Rapport
(rapport de recherche)
hal-00779951
v1
|
|
Game Theory for Real-Time Synthesis: Decision, Approximation, and RandomnessComputer Science and Game Theory [cs.GT]. Aix-Marseille Université, 2022
HDR
tel-03663275
v1
|
|
Specification and verification of quantitative properties : expressions, logics, and automataOther [cs.OH]. École normale supérieure de Cachan - ENS Cachan, 2013. English. ⟨NNT : 2013DENS0039⟩
Thèse
tel-00957763
v1
|
Chargement...
Chargement...