Benjamin Monmege

According to our database1, Benjamin Monmege
  • authored at least 30 papers between 2008 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Optimal Reachability in Divergent Weighted Timed Games.
CoRR, 2017

Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games.
Acta Inf., 2017

Timed-Automata-Based Verification of MITL over Signals.
Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

Optimal Reachability in Divergent Weighted Timed Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

MightyL: A Compositional Translation from MITL to Timed Automata.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Real-Time Synthesis is Hard!
CoRR, 2016

Efficient Energy Distribution in a Smart Grid using Multi-Player Games.
Proceedings of the Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters and 3rd International Workshop on Synthesis of Complex Parameters, 2016

Real-Time Synthesis is Hard!
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

2015
Quantitative Games under Failures.
CoRR, 2015

Simple Priced Timed Games Are Not That Simple.
CoRR, 2015

Quantitative Games under Failures.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Simple Priced Timed Games are not That Simple.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

2014
Pebble Weighted Automata and Weighted Logics.
ACM Trans. Comput. Log., 2014

Adding pebbles to weighted automata: Easy specification & efficient evaluation.
Theor. Comput. Sci., 2014

Adding Negative Prices to Priced Timed Games.
CoRR, 2014

To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
CoRR, 2014

A Robust Class of Data Languages and an Application to Learning.
Logical Methods in Computer Science, 2014

Reachability in MDPs: Refining Convergence of Value Iteration.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

Logical characterization of weighted pebble walking automata.
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), 2014

Adding Negative Prices to Priced Timed Games.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Specification and verification of quantitative properties : expressions, logics, and automata. (Spécification et vérification de propriétés quantitatives : expressions, logiques et automates).
PhD thesis, 2013

Weighted Specifications over Nested Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

A Fresh Approach to Learning Register Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Bounded underapproximations.
Formal Methods in System Design, 2012

Adding Pebbles to Weighted Automata.
Proceedings of the Implementation and Application of Automata, 2012

A Probabilistic Kleene Theorem.
Proceedings of the Automated Technology for Verification and Analysis, 2012

2010
Pebble Weighted Automata and Transitive Closure Logics.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Bounded Underapproximations.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2008
Parikh-Equivalent Bounded Underapproximations
CoRR, 2008


  Loading...