Sledovat
Ocan Sankur
Ocan Sankur
CNRS, Université de Rennes
E-mailová adresa ověřena na: cnrs.fr - Domovská stránka
Název
Citace
Citace
Rok
Percentile queries in multi-dimensional Markov decision processes
M Randour, JF Raskin, O Sankur
Formal methods in system design 50, 207-248, 2017
862017
Assume-admissible synthesis
R Brenguier, JF Raskin, O Sankur
Acta Informatica 54, 41-83, 2017
762017
The 4th reactive synthesis competition (SYNTCOMP 2017): Benchmarks, participants & results
S Jacobs, N Basset, R Bloem, R Brenguier, M Colange, P Faymonville, ...
arXiv preprint arXiv:1711.11439, 2017
692017
The first reactive synthesis competition (SYNTCOMP 2014)
S Jacobs, R Bloem, R Brenguier, R Ehlers, T Hell, R Könighofer, ...
International journal on software tools for technology transfer 19, 367-390, 2017
562017
Non-zero sum games for reactive synthesis
R Brenguier, L Clemente, P Hunter, GA Pérez, M Randour, JF Raskin, ...
Language and Automata Theory and Applications, 3-23, 2016
552016
Variations on the stochastic shortest path problem
M Randour, JF Raskin, O Sankur
International Workshop on Verification, Model Checking, and Abstract …, 2015
552015
Online correlation clustering
C Mathieu, O Sankur, W Schudy
STACS'10, 2010
472010
Robustness in timed automata
P Bouyer, N Markey, O Sankur
International Workshop on Reachability Problems, 1-18, 2013
392013
Shrinking timed automata
O Sankur, P Bouyer, N Markey
Information and Computation 234, 107-132, 2014
382014
Robust reachability in timed automata and games: A game-based approach
P Bouyer, N Markey, O Sankur
Theoretical Computer Science 563, 43-74, 2015
372015
Robust controller synthesis in timed automata
O Sankur, P Bouyer, N Markey, PA Reynier
CONCUR'13, 2013
332013
Timed automata can always be made implementable
P Bouyer, KG Larsen, N Markey, O Sankur, C Thrane
International Conference on Concurrency Theory, 76-91, 2011
332011
AbsSynthe: abstract synthesis from succinct safety specifications
R Brenguier, GA Pérez, JF Raskin, O Sankur
arXiv preprint arXiv:1407.5961, 2014
322014
Robust model-checking of timed automata via pumping in channel machines
P Bouyer, N Markey, O Sankur
FORMATS'11 - Formal Modeling and Analysis of Timed Systems, 97-112, 2011
282011
Games on graphs
N Fijalkow, N Bertrand, P Bouyer-Decitre, R Brenguier, A Carayol, ...
arXiv preprint arXiv:2305.10546, 2023
272023
The second reactive synthesis competition (SYNTCOMP 2015)
S Jacobs, R Bloem, R Brenguier, R Könighofer, GA Pérez, JF Raskin, ...
arXiv preprint arXiv:1602.01171, 2016
262016
Stochastic shortest paths and weight-bounded properties in Markov decision processes
C Baier, N Bertrand, C Dubslaff, D Gburek, O Sankur
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
252018
The 3rd reactive synthesis competition (SYNTCOMP 2016): Benchmarks, participants & results
S Jacobs, R Bloem, R Brenguier, A Khalimov, F Klein, R Könighofer, ...
arXiv preprint arXiv:1609.00507, 2016
202016
Symbolic quantitative robustness analysis of timed automata
O Sankur
International Conference on Tools and Algorithms for the Construction and …, 2015
202015
Probabilistic robust timed games
Y Oualhadj, PA Reynier, O Sankur
International Conference on Concurrency Theory, 203-217, 2014
202014
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20