Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Romain Brenguier"'
Autor:
Swen Jacobs, Nicolas Basset, Roderick Bloem, Romain Brenguier, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Thibaud Michaud, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur, Leander Tentrup
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 260, Iss Proc. SYNT 2017, Pp 116-143 (2017)
We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We introduce two new benchmark classes that have been added to the SYNTCOMP library, and briefly describe the benchmark selection, evaluation scheme and the experimental setup of
Externí odkaz:
https://doaj.org/article/0a5e0070b565485da8511bb0df92db2f
Autor:
Swen Jacobs, Roderick Bloem, Romain Brenguier, Ayrat Khalimov, Felix Klein, Robert Könighofer, Jens Kreber, Alexander Legg, Nina Narodytska, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 229, Iss Proc. SYNT 2016, Pp 149-177 (2016)
We report on the benchmarks, participants and results of the third reactive synthesis competition(SYNTCOMP 2016). The benchmark library of SYNTCOMP 2016 has been extended to benchmarks in the new LTL-based temporal logic synthesis format (TLSF), and
Externí odkaz:
https://doaj.org/article/aaccd15b40d741e083b82d2c6cd3e043
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 202, Iss Proc. SYNT 2015, Pp 98-111 (2016)
We study the synthesis of circuits for succinct safety specifications given in the AIG format. We show how AIG safety specifications can be decomposed automatically into sub specifications. Then we propose symbolic compositional algorithms to solve t
Externí odkaz:
https://doaj.org/article/435c1113aa274153a49aeab2d64b1c6c
Autor:
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, Adam Walker
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 202, Iss Proc. SYNT 2015, Pp 27-57 (2016)
We report on the design and results of the second reactive synthesis competition (SYNTCOMP 2015). We describe our extended benchmark library, with 6 completely new sets of benchmarks, and additional challenging instances for 4 of the benchmark sets t
Externí odkaz:
https://doaj.org/article/a9c45a590c8c4abeb527d9ec981ba822
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 157, Iss Proc. SYNT 2014, Pp 100-116 (2014)
In this paper, we describe a synthesis algorithm for safety specifications described as circuits. Our algorithm is based on fixpoint computations, abstraction and refinement, it uses binary decision diagrams as symbolic data structure. We evaluate ou
Externí odkaz:
https://doaj.org/article/41354c88bce04256a7ecf4fcbc745331
Publikováno v:
Logical Methods in Computer Science, Vol Volume 11, Issue 2 (2015)
We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a two-player
Externí odkaz:
https://doaj.org/article/85eee5656e9e4062b9e3a5ec062b2097
Autor:
Thibaud Michaud, Peter Faymonville, Maximilien Colange, Nicolas Basset, Romain Brenguier, Roderick Bloem, Leander Tentrup, Ayrat Khalimov, Guillermo A. Pérez, Swen Jacobs, Jean-François Raskin, Ocan Sankur, Bernd Finkbeiner, Felix Klein
Publikováno v:
Electronic Proceedings in Theoretical Computer Science
Electronic proceedings in theoretical computer science, 260
SYNT@CAV
Electronic Proceedings in Theoretical Computer Science, Vol 260, Iss Proc. SYNT 2017, Pp 116-143 (2017)
Electronic proceedings in theoretical computer science, 260
SYNT@CAV
Electronic Proceedings in Theoretical Computer Science, Vol 260, Iss Proc. SYNT 2017, Pp 116-143 (2017)
We report on the fourth reactive synthesis competition (SYNTCOMP 2017). We introduce two new benchmark classes that have been added to the SYNTCOMP library, and briefly describe the benchmark selection, evaluation scheme and the experimental setup of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::862e8c1cd9dd6a32df164e4026c76f01
Autor:
Vojtěch Forejt, Romain Brenguier
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783319465197
ATVA
ATVA
We study stochastic two-player turn-based games in which the objective of one player is to ensure several infinite-horizon total reward objectives, while the other player attempts to spoil at least one of the objectives. The games have previously bee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3b6d934f180df5690971d720c956f57
http://arxiv.org/abs/1605.03811
http://arxiv.org/abs/1605.03811
Autor:
Romain Brenguier
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662496299
FoSSaCS
FoSSaCS
We study the problem of finding robust equilibria in multiplayer concurrent games with mean payoff objectives. A (k, t)-robust equilibrium is a strategy profile such that no coalition of size k can improve the payoff of one its member by deviating, a
Publikováno v:
Acta Informatica
Acta Informatica, Springer Verlag, 2016, ⟨10.1007/s00236-016-0273-2⟩
26th International Conference on Concurrency Theory (CONCUR 2015)
26th International Conference on Concurrency Theory (CONCUR 2015), Sep 2015, Madrid, Spain. pp.100--113, ⟨10.4230/LIPIcs.CONCUR.2015.100⟩
Acta Informatica, 2016, ⟨10.1007/s00236-016-0273-2⟩
Acta Informatica, Springer Verlag, 2016, ⟨10.1007/s00236-016-0273-2⟩
26th International Conference on Concurrency Theory (CONCUR 2015)
26th International Conference on Concurrency Theory (CONCUR 2015), Sep 2015, Madrid, Spain. pp.100--113, ⟨10.4230/LIPIcs.CONCUR.2015.100⟩
Acta Informatica, 2016, ⟨10.1007/s00236-016-0273-2⟩
In this paper, we introduce a novel rule for synthesis of reactive systems, applicable to systems made of n components which have each their own objectives. It is based on the notion of admissible strategies. We compare our novel rule with previous r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2700f8a141dab9e59de73f03337f437c
https://hal.inria.fr/hal-01373538/file/aa.pdf
https://hal.inria.fr/hal-01373538/file/aa.pdf