Romain Brenguier

According to our database1, Romain Brenguier
  • authored at least 30 papers between 2010 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Assume-admissible synthesis.
Acta Inf., 2017

2016
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Admissibility in Quantitative Graph Games.
CoRR, 2016

Decidability Results for Multi-objective Stochastic Games.
CoRR, 2016

Optimal Assumptions for Synthesis.
CoRR, 2016

Non-Zero Sum Games for Reactive Synthesis.
Proceedings of the Language and Automata Theory and Applications, 2016

Admissibility in Quantitative Graph Games.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Robust Equilibria in Mean-Payoff Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Optimal Assumptions for Synthesis.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Decidability Results for Multi-objective Stochastic Games.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
The Second Reactive Synthesis Competition (SYNTCOMP 2015).
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

The First Reactive Synthesis Competition (SYNTCOMP 2014).
CoRR, 2015

Assume-Admissible Synthesis.
CoRR, 2015

Compositional Algorithms for Succinct Safety Games.
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

Non-Zero Sum Games for Reactive Synthesis.
CoRR, 2015

Pure Nash Equilibria in Concurrent Deterministic Games.
Logical Methods in Computer Science, 2015

Assume-Admissible Synthesis.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Pareto Curves of Multidimensional Mean-Payoff Games.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
AbsSynthe: abstract synthesis from succinct safety specifications.
Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Energy and mean-payoff timed games.
Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2014

The complexity of admissibility in Omega-regular games.
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

2013
The Complexity of Admissibility in Omega-Regular Games
CoRR, 2013

Robust Equilibria in Concurrent Games.
CoRR, 2013

PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Equilibres de Nash dans les jeux concurrents : application aux jeux temporisés. (Nash equilibria in concurrent games : application to timed games).
PhD thesis, 2012

Concurrent Games with Ordered Objectives.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Comparison of Succinctly Represented Finite-State Systems.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Nash Equilibria in Concurrent Games with Büchi Objectives.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Nash Equilibria for Reachability Objectives in Multi-player Timed Games.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010


  Loading...