Romain Brenguier : Publications

Journal papers

• [1]

  The First Reactive Synthesis Competition (SYNTCOMP 2014)

  Swen Jacobs‚ Roderick Bloem‚ Romain Brenguier‚ Rüdiger Ehlers‚ Timotheus Hell‚ Robert Könighofer‚ Guillermo A. Pérez‚ Jean−François Raskin‚ Leonid Ryzhyk‚ Ocan Sankur‚ Martina Seidl‚ Leander Tentrup and Adam Walker

  In International Journal on Software Tools for Technology Transfer (STTT). Vol. abs/1506.08726. 2016.

  Details about The First Reactive Synthesis Competition (SYNTCOMP 2014) | BibTeX data for The First Reactive Synthesis Competition (SYNTCOMP 2014) | Link to The First Reactive Synthesis Competition (SYNTCOMP 2014)

• [2]

  Pure Nash Equilibria in Concurrent Games

  Patricia Bouyer‚ Romain Brenguier‚ Nicolas Markey and Michael Ummels

  In Logical Methods in Computer Science. Vol. 11. No. 2:9. June, 2015.

  Details about Pure Nash Equilibria in Concurrent Games | BibTeX data for Pure Nash Equilibria in Concurrent Games | DOI (10.2168/LMCS-11(2:9)2015) | Download (pdf) of Pure Nash Equilibria in Concurrent Games

Conference papers

• [1]

  Decidability Results for Multi−objective Stochastic Games

  Romain Brenguier and Vojtech Forejt

  In ATVA 2016. 2016.

  Details about Decidability Results for Multi−objective Stochastic Games | BibTeX data for Decidability Results for Multi−objective Stochastic Games

• [2]

  Optimal Assumptions for Synthesis

  Romain Brenguier

  In CONCUR 2016. 2016.

  Details about Optimal Assumptions for Synthesis | BibTeX data for Optimal Assumptions for Synthesis

• [3]

  Non−Zero Sum Games for Reactive Synthesis

  Romain Brenguier‚ Lorenzo Clemente‚ Paul Hunter‚ Guillermo A. Pérez‚ Mickael Randour‚ Jean−François Raskin‚ Ocan Sankur and Mathieu Sassolas

  In LATA. 2016.

  Details about Non−Zero Sum Games for Reactive Synthesis | BibTeX data for Non−Zero Sum Games for Reactive Synthesis

• [4]

  Robust Equilibria in Mean−Payoff Games

  Romain Brenguier

  In FoSSaCS 2016. 2016.

  Details about Robust Equilibria in Mean−Payoff Games | BibTeX data for Robust Equilibria in Mean−Payoff Games

• [5]

  Compositional Algorithms for Succinct Safety Games

  Jean−François Raskin Romain Brenguier Guillermo A. Pérez and Ocan Sankur

  In SYNT 2015. 2015.

  Details about Compositional Algorithms for Succinct Safety Games | BibTeX data for Compositional Algorithms for Succinct Safety Games

• [6]

  The Second Reactive Synthesis Competition (SYNTCOMP 2015)

  Swen Jacobs‚ Roderick Bloem‚ Romain Brenguier‚ Robert Könighofer‚ Guillermo A. Pérez‚ Jean−François Raskin‚ Leonid Ryzhyk‚ Ocan Sankur‚ Martina Seidl‚ Leander Tentrup and Adam Walker

  In SYNT 2015. 2015.

  Details about The Second Reactive Synthesis Competition (SYNTCOMP 2015) | BibTeX data for The Second Reactive Synthesis Competition (SYNTCOMP 2015)

• [7]

  Pareto Curves of Multidimensional Mean−Payoff Games

  Romain Brenguier and Jean−François Raskin

  In Computer Aided Verification − 27th International Conference‚ CAV 2015‚ San Francisco‚ CA‚ USA‚ July 18−24‚ 2015‚ Proceedings‚ Part II. Vol. 9207 of Lecture Notes in Computer Science. Pages 251–267. Springer. 2015.

  Details about Pareto Curves of Multidimensional Mean−Payoff Games | BibTeX data for Pareto Curves of Multidimensional Mean−Payoff Games | DOI (10.1007/978-3-319-21668-3_15) | Link to Pareto Curves of Multidimensional Mean−Payoff Games

• [8]

  Assume−Admissible Synthesis

  Romain Brenguier‚ Jean−François Raskin and Ocan Sankur

  In 26th International Conference on Concurrency Theory‚ CONCUR 2015‚ Madrid‚ Spain‚ September 1.4‚ 2015. Pages 100–113. 2015.

  Details about Assume−Admissible Synthesis | BibTeX data for Assume−Admissible Synthesis | DOI (10.4230/LIPIcs.CONCUR.2015.100) | Link to Assume−Admissible Synthesis

• [9]

  Energy and Mean−Payoff Timed Games

  Romain Brenguier‚ Franck Cassez and Jean−François Raskin

  In HSCC 2014. April, 2014.

  Details about Energy and Mean−Payoff Timed Games | BibTeX data for Energy and Mean−Payoff Timed Games

• [10]

  The complexity of admissibility in Omega−regular games

  Romain Brenguier‚ Jean−François Raskin and Mathieu Sassolas

  In Thomas A. Henzinger and Dale Miller, editors, 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)‚ CSL−LICS '14‚ Vienna‚ Austria‚ July 14 − 18‚ 2014. Pages 23:1–23:10. ACM. 2014.

  Details about The complexity of admissibility in Omega−regular games | BibTeX data for The complexity of admissibility in Omega−regular games | DOI (10.1145/2603088.2603143) | Link to The complexity of admissibility in Omega−regular games

• [11]

  AbsSynthe: abstract synthesis from succinct safety specifications

  Romain Brenguier‚ Guillermo A Pérez‚ Jean−François Raskin and Ocan Sankur

  In SYNT 2014. 2014.

  Details about AbsSynthe: abstract synthesis from succinct safety specifications | BibTeX data for AbsSynthe: abstract synthesis from succinct safety specifications

• [12]

  PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games

  Romain Brenguier

  In Natasha Sharygina and Helmut Veith, editors, Proceedings of the 23th International Conference on Computer Aided Verification (CAV'13). Vol. 8044 of Lecture Notes in Computer Science. Pages 890−895. Saint Petersburg‚ Russia. July, 2013. Springer.

  Details about PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games | BibTeX data for PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games | DOI (10.1007/978-3-642-39799-8_63) | Download (pdf) of PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games

• [13]

  Concurrent games with ordered objectives

  Patricia Bouyer‚ Romain Brenguier‚ Nicolas Markey and Michael Ummels

  In Proceedings of the 15th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS'12). Vol. 7213 of Lecture Notes in Computer Science. Pages 301−315. Springer−Verlag. March, 2012.

  Details about Concurrent games with ordered objectives | BibTeX data for Concurrent games with ordered objectives

• [14]

  A Comparison of Succinctly Represented Finite−State Systems

  Romain Brenguier‚ Stefan Göller and Ocan Sankur

  In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12). Vol. 7454 of Lecture Notes in Computer Science. Pages 147−161. Newcastle‚ UK. September, 2012. Springer.

  Details about A Comparison of Succinctly Represented Finite−State Systems | BibTeX data for A Comparison of Succinctly Represented Finite−State Systems | DOI (10.1007/978-3-642-32940-1_12) | Download (pdf) of A Comparison of Succinctly Represented Finite−State Systems

• [15]

  Nash Equilibria in Concurrent Games with Büchi Objectives

  Patricia Bouyer‚ Romain Brenguier‚ Nicolas Markey and Michael Ummels

  In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11). Vol. 13 of Leibniz International Proceedings in Informatics. Pages 375−386. Mumbai‚ India. December, 2011. Leibniz−Zentrum für Informatik.

  Details about Nash Equilibria in Concurrent Games with Büchi Objectives | BibTeX data for Nash Equilibria in Concurrent Games with Büchi Objectives

• [16]

  Computing Equilibria in Two−Player Timed Games via Turn−Based Finite Games

  Patricia Bouyer‚ Romain Brenguier and Nicolas Markey

  In Proceedings of the 8th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'10). Vol. 6246 of Lecture Notes in Computer Science. Pages 62−76. Vienna‚ Austria. September, 2010. Springer.

  Details about Computing Equilibria in Two−Player Timed Games via Turn−Based Finite Games | BibTeX data for Computing Equilibria in Two−Player Timed Games via Turn−Based Finite Games | DOI (10.1007/978-3-642-15297-9_7) | Download (pdf) of Computing Equilibria in Two−Player Timed Games via Turn−Based Finite Games

• [17]

  Nash Equilibria for Reachability Objectives in Multi−player Timed Games

  Patricia Bouyer‚ Romain Brenguier and Nicolas Markey

  In Proceedings of the 21st International Conference on Concurrency Theory (CONCUR'10). Vol. 6269 of Lecture Notes in Computer Science. Pages 192−206. Springer−Verlag. September, 2010.

  Details about Nash Equilibria for Reachability Objectives in Multi−player Timed Games | BibTeX data for Nash Equilibria for Reachability Objectives in Multi−player Timed Games

Theses

• [1]

  Équilibres de Nash dans les Jeux Concurrents – Application aux Jeux Temporisés

  Romain Brenguier

  PhD Thesis , type= Thèse de doctorat. Laboratoire Spécification et Vérification‚ ENS Cachan‚ France. 2012.

  Details about Équilibres de Nash dans les Jeux Concurrents – Application aux Jeux Temporisés | BibTeX data for Équilibres de Nash dans les Jeux Concurrents – Application aux Jeux Temporisés

• [2]

  Calcul des équilibres de Nash dans les jeux temporisés

  Romain Brenguier

  Master's Thesis , type= Rapport de Master. Master Parisien de Recherche en Informatique‚ Paris‚ France. September, 2009.

  Details about Calcul des équilibres de Nash dans les jeux temporisés | BibTeX data for Calcul des équilibres de Nash dans les jeux temporisés | Download (pdf) of Calcul des équilibres de Nash dans les jeux temporisés

Miscellaneous

• [1]

  Praline: A Tool for Computing Nash Equilibria in Concurrent Games

  Romain Brenguier

  2013.

  Details about Praline: A Tool for Computing Nash Equilibria in Concurrent Games | BibTeX data for Praline: A Tool for Computing Nash Equilibria in Concurrent Games