Ocan Sankur
Ocan Sankur
Univ Rennes, CNRS
Verified email at - Homepage
Cited by
Cited by
Percentile queries in multi-dimensional Markov decision processes
M Randour, JF Raskin, O Sankur
Formal methods in system design 50, 207-248, 2017
Assume-admissible synthesis
R Brenguier, JF Raskin, O Sankur
Acta Informatica 54, 41-83, 2017
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
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
Variations on the stochastic shortest path problem
M Randour, JF Raskin, O Sankur
Verification, Model Checking, and Abstract Interpretation: 16th …, 2015
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: 10th International Conference …, 2016
Online correlation clustering
C Mathieu, O Sankur, W Schudy
STACS'10, 2010
Shrinking timed automata
O Sankur, P Bouyer, N Markey
Information and Computation 234, 107-132, 2014
Robustness in timed automata
P Bouyer, N Markey, O Sankur
Reachability Problems: 7th International Workshop, RP 2013, Uppsala, Sweden …, 2013
AbsSynthe: abstract synthesis from succinct safety specifications
R Brenguier, GA Pérez, JF Raskin, O Sankur
arXiv preprint arXiv:1407.5961, 2014
Robust reachability in timed automata and games: A game-based approach
P Bouyer, N Markey, O Sankur
Theoretical Computer Science 563, 43-74, 2015
Timed automata can always be made implementable
P Bouyer, KG Larsen, N Markey, O Sankur, C Thrane
CONCUR 2011–Concurrency Theory: 22nd International Conference, CONCUR 2011 …, 2011
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
Robust controller synthesis in timed automata
O Sankur, P Bouyer, N Markey, PA Reynier
CONCUR'13, 2013
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
Symbolic quantitative robustness analysis of timed automata
O Sankur
Tools and Algorithms for the Construction and Analysis of Systems: 21st …, 2015
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
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
Complexity of planning for connected agents
T Charrier, A Queffelec, O Sankur, F Schwarzentruber
Autonomous Agents and Multi-Agent Systems 34, 1-31, 2020
Probabilistic robust timed games
Y Oualhadj, PA Reynier, O Sankur
CONCUR 2014–Concurrency Theory: 25th International Conference, CONCUR 2014 …, 2014
The system can't perform the operation now. Try again later.
Articles 1–20