Number of documents

28

Publications of Benjamin Monmege


Journal articles7 documents

  • Serge Haddad, Benjamin Monmege. Interval Iteration Algorithm for MDPs and IMDPs. Theoretical Computer Science, Elsevier, 2018, 735, pp.111 - 131. ⟨10.1016/j.tcs.2016.12.003⟩. ⟨hal-01809094⟩
  • Paul Gastin, Benjamin Monmege. A Unifying Survey on Weighted Logics and Weighted Automata: Core Weighted Logic: Minimal and Versatile Specification of Quantitative Properties. Soft Computing, Springer Verlag, 2018, 22 (4), pp.1047-1065. ⟨10.1007/s00500-015-1952-6⟩. ⟨hal-01130216v2⟩
  • Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Informatica, Springer Verlag, 2017, Special Issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015), 54 (1), pp.85--125. ⟨10.1007/s00236-016-0276-z⟩. ⟨hal-01414114⟩
  • Paul Gastin, Benjamin Monmege. Adding Pebbles to Weighted Automata: Easy Specification & Efficient Evaluation. Theoretical Computer Science, Elsevier, 2014, 534, ⟨10.1016/j.tcs.2014.02.034⟩. ⟨hal-01091105v2⟩
  • Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, 10 (4:19), ⟨10.2168/LMCS-10(4:19)2014⟩. ⟨hal-00920945v2⟩
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Pebble Weighted Automata and Weighted Logics. ACM Transactions on Computational Logic, Association for Computing Machinery, 2014, 15 (2), pp.15. ⟨10.1145/2579819⟩. ⟨hal-00964994v2⟩
  • Pierre Ganty, Rupak Majumdar, Benjamin Monmege. Bounded underapproximations. Formal Methods in System Design, Springer Verlag, 2012, 40 (2), pp.206-231. ⟨10.1007/s10703-011-0136-y⟩. ⟨hal-00776791⟩

Conference papers19 documents

  • Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur. Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. 31st International Conference on Computer Aided Verification, Jul 2019, New-York, United States. pp.572-590. ⟨hal-02264083⟩
  • Thomas Brihaye, Arthur Milchior, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege. Efficient algorithms and tools for MITL model-checking and synthesis. 23rd International Conference on Engineering of Complex Computer Systems (ICECCS), Dec 2018, Melbourne, Australia. ⟨hal-02014073⟩
  • Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier. Symbolic Approximation of Weighted Timed Games. 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), Dec 2018, Ahmedabad, India. ⟨10.4230/LIPIcs.FSTTCS.2018.28⟩. ⟨hal-02014051⟩
  • Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege. Timed-Automata-Based Verification of MITL over Signals. 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Oct 2017, Mons, France. pp.7:1--7:19, ⟨10.4230/LIPIcs.TIME.2017.7⟩. ⟨hal-01526986⟩
  • Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier. Optimal Reachability in Divergent Weighted Timed Games. 20th 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⟩. ⟨hal-01522546⟩
  • Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Efficient Energy Distribution in a Smart Grid using Multi-Player Games. Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) , Apr 2016, Eindhoven, Netherlands. pp.1 - 12, ⟨10.4204/EPTCS.220.1⟩. ⟨hal-01452611⟩
  • Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, et al.. 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⟩. ⟨hal-01344684⟩
  • Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege. Simple Priced Timed Games Are Not That Simple. Proceedings 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⟩. ⟨hal-01452621⟩
  • Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, et al.. Quantitative Games under Failures. 35th 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⟩. ⟨hal-01273251⟩
  • Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), Sep 2015, Madrid, Spain. pp.297-310, ⟨10.4230/LIPIcs.CONCUR.2015.297⟩. ⟨hal-01273475⟩
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Logical Characterization of Weighted Pebble Walking Automata. CSL-LICS '14, Jul 2014, Vienna, Austria. ⟨10.1145/2603088.2603118⟩. ⟨hal-01006125⟩
  • Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, et al.. Adding Negative Prices to Priced Timed Games. 25th International Conference on Concurrency Theory (CONCUR'14), Sep 2014, Rome, Italy. pp.560-575, ⟨10.1007/978-3-662-44584-6_38⟩. ⟨hal-01273480⟩
  • Serge Haddad, Benjamin Monmege. Reachability in MDPs: Refining Convergence of Value Iteration. 8th International Workshop on Reachability Problems (RP'14), Sep 2014, Oxford, United Kingdom. pp.125-137, ⟨10.1007/978-3-319-11439-2_10⟩. ⟨hal-01091122v2⟩
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege. Weighted Specifications over Nested Words. Foundations of Software Science and Computation Structures (FoSSaCS'13), Mar 2013, Rome, Italy. pp.385-400, ⟨10.1007/978-3-642-37075-5_25⟩. ⟨hal-00909035⟩
  • Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege. A Fresh Approach to Learning Register Automata. Developments in Language Theory, 2013, France. pp.118-130, ⟨10.1007/978-3-642-38771-5_12⟩. ⟨hal-00908998⟩
  • Paul Gastin, Benjamin Monmege. Adding Pebbles to Weighted Automata. Proceedings 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⟩. ⟨hal-00776603⟩
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. A Probabilistic Kleene Theorem. Automated Technology for Verification and Analysis (ATVA'12), Oct 2012, Thiruvananthapuram, India. pp.400-415, ⟨10.1007/978-3-642-33386-6_31⟩. ⟨hal-00909042⟩
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Pebble weighted automata and transitive closure logics. Proceedings 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⟩. ⟨hal-00608179⟩
  • Pierre Ganty, Rupak Majumdar, Benjamin Monmege. Bounded Underapproximations. Proceedings 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⟩. ⟨hal-00608175⟩

Reports2 documents

  • Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege. A Fresh Approach to Learning Register Automata. 2012. ⟨hal-00743240v3⟩
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Weighted Expressions and DFS Tree Automata. [Research Report] LSV-11-08, 2011. ⟨hal-00779951⟩