Nombre de documents

24

Publications de Benjamin Monmege


Article dans une revue6 documents

  • 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. A Unifying Survey on Weighted Logics and Weighted Automata: Core Weighted Logic: Minimal and Versatile Specification of Quantitative Properties. Soft Computing, Springer Verlag, 2015, 〈10.1007/s00500-015-1952-6〉. 〈hal-01130216v2〉
  • Paul Gastin, Benjamin Monmege. Adding Pebbles to Weighted Automata: Easy Specification & Efficient Evaluation. Journal of Theoretical Computer Science (TCS), 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〉

Communication dans un congrès15 documents

  • Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier. Optimal Reachability in Divergent Weighted Timed Games. Javier Esparza; Andrzej S. Murawski. 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Apr 2017, Uppsala, Sweden. Springer, Lecture Notes in Computer Science, 10203, pp.162-178, 2017, Foundations of Software Science and Computation Structures. 20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings. 〈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. EPTCS, 220, pp.1 - 12, 2016, Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems (Cassting'16) and the 3rd International Workshop on Synthesis of Complex Parameters (SynCoP'16). 〈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!. Martin Fränzle; Nicolas Markey. 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16), Aug 2016, Québec City, Canada. Springer, Proceedings of the 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16), 9884, pp.105-120, 2016, Lecture Notes in Computer Science. 〈10.1007/978-3-319-44878-7_7〉. 〈hal-01344684〉
  • 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. 45, pp.293-306, 2015, Leibniz International Proceedings in Informatics 〈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. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 42, pp.297-310, 2015, Leibniz International Proceedings in Informatics 〈10.4230/LIPIcs.CONCUR.2015.297〉. 〈hal-01273475〉
  • Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege. Simple Priced Timed Games Are Not That Simple. Prahladh Harsha and G. Ramalingam. Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), Dec 2015, Bangalore, India. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 45, pp.278-292, Leibniz International Proceedings in Informatics 〈10.4230/LIPIcs.FSTTCS.2015.p〉. 〈hal-01452621〉
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Logical Characterization of Weighted Pebble Walking Automata. CSL-LICS '14, Jul 2014, Vienna, Austria. 2014, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). 〈10.1145/2603088.2603118〉. 〈hal-01006125〉
  • 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. Springer-Verlag, 8762, pp.125-137, 2014, Proceedings of the 8th International Workshop on Reachability Problems (RP'14). 〈10.1007/978-3-319-11439-2_10〉. 〈hal-01091122v2〉
  • 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. Springer-Verlag, 8704, pp.560-575, 2014, Lecture Notes in Computer Science. 〈10.1007/978-3-662-44584-6_38〉. 〈hal-01273480〉
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege. Weighted Specifications over Nested Words. Foundations of Software Science and Computation Structures (FoSSaCS'13), Mar 2013, Rome, Italy. 7794, pp.385-400, 2013, Lecture Notes in Computer Science. 〈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. 7907, pp.118-130, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38771-5_12〉. 〈hal-00908998〉
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. A Probabilistic Kleene Theorem. Mukund, Madhavan and Chakraborty, Supratik. Automated Technology for Verification and Analysis (ATVA'12), Oct 2012, Thiruvananthapuram, India. Springer, 7561, pp.400-415, 2012, Lecture Notes in Computer Science. 〈10.1007/978-3-642-33386-6_31〉. 〈hal-00909042〉
  • Paul Gastin, Benjamin Monmege. Adding Pebbles to Weighted Automata. Moreira, Nelma and Reis, Rogério. Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), 2012, Porto, Portugal. Springer-Verlag, 7381, pp.28-51, 2012, 〈10.1007/978-3-642-31606-7_4〉. 〈hal-00776603〉
  • Pierre Ganty, Rupak Majumdar, Benjamin Monmege. Bounded Underapproximations. B. Cook, P. Jackson and T. Touili. Proceedings of the 22nd International Conference on Computer Aided Verification (CAV'10), Jul 2010, Edinburgh, United Kingdom. Springer, 6174, pp.600-614, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-14295-6_52〉. 〈hal-00608175〉
  • Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Pebble weighted automata and transitive closure logics. S. Abramsky, F. Meyer auf der Heide and P. Spirakis. Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) - Part II, Jul 2010, Bordeaux, France. Springer, 6199, pp.587-598, 2010, Lecture Notes in Computer Science. 〈10.1007/978-3-642-14162-1_49〉. 〈hal-00608179〉

Pré-publication, Document de travail1 document

  • Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege. Timed-automata-based verification of MITL over signals. 2017. 〈hal-01526986〉

Rapport2 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〉