Get started
Author

Ocan Sankur

Observed names: O. Sankur, Sankur, Ocan
Institutions: Centre National de la Recherche Scientifique, Institut de Recherche en Informatique et Systèmes Aléatoires, Mitsubishi Electric (France), Centre Inria de l'Université de Rennes, DEVINE: Vérification efficace pour des systèmes distribués fiables, Université de Rennes
Observed institutions: École Normale Supérieure Paris-Saclay, Centre National de la Recherche Scientifique, Université Libre de Bruxelles, Institut national de recherche en sciences et technologies du numérique, Institut de Recherche en Informatique et Systèmes Aléatoires, École Normale Supérieure - PSL, Centre National pour la Recherche Scientifique et Technique (CNRST), Mitsubishi Electric (France), Laboratoire Spécification et Vérification, Centre National de la Recherche Scientifique et Technologique, Centre Inria de l'Université de Rennes, DEVINE: Vérification efficace pour des systèmes distribués fiables, Université de Rennes
ORCID: 0000-0001-8146-4429
Observed ORCID: 0000-0001-8146-4429
OpenAlex ID: A5059019724
Assume-admissible synthesis
2016 · Romain Brenguier, Jean-François Raskin, et al. · Acta Informatica · 44
PDF
Percentile Queries in Multi-dimensional Markov Decision Processes
2015 · Mickael Randour, Jean-François Raskin, et al. · Lecture notes in computer science · 40
PDF
Variations on the Stochastic Shortest Path Problem
2014 · Mickael Randour, Jean-François Raskin, et al. · Lecture notes in computer science · 38
PDF
Percentile queries in multi-dimensional Markov decision processes
2017 · Mickael Randour, Jean-François Raskin, et al. · Formal Methods in System Design · 33
PDF
The first reactive synthesis competition (SYNTCOMP 2014)
2016 · Swen Jacobs, Roderick Bloem, et al. · International Journal on Software Tools for Technology Transfer · 33
PDF
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results
2017 · Swen Jacobs, Nicolas Basset, et al. · Electronic Proceedings in Theoretical Computer Science · 31
PDF
Non-Zero Sum Games for Reactive Synthesis
2016 · Romain Brenguier, Lorenzo Clemente, et al. · Lecture notes in computer science · 31
PDF
Shrinking timed automata
2014 · Ocan Sankur, Patricia Bouyer, et al. · Information and Computation · 27
Timed Automata Can Always Be Made Implementable
2011 · Patricia Bouyer, Kim G. Larsen, et al. · Lecture notes in computer science · 27
Non-Zero Sum Games for Reactive Synthesis
2015 · Brenguier, Romain, Clemente, Lorenzo, et al. · arXiv (Cornell University) · 26
PDF
Online Correlation Clustering
2010 · Mathieu, Claire, Sankur, Ocan, et al. · arXiv (Cornell University) · 26
PDF
AbsSynthe: abstract synthesis from succinct safety specifications
2014 · Romain Brenguier, Guillermo A. Pérez, et al. · Electronic Proceedings in Theoretical Computer Science · 25
PDF
Robust Controller Synthesis in Timed Automata
2013 · Ocan Sankur, Patricia Bouyer, et al. · Lecture notes in computer science · 19
Robustness in Timed Automata
2013 · Patricia Bouyer, Nicolas Markey, et al. · Lecture notes in computer science · 19
Robust Reachability in Timed Automata: A Game-Based Approach
2012 · Patricia Bouyer, Nicolas Markey, et al. · Lecture notes in computer science · 19
Robust Model-Checking of Timed Automata via Pumping in Channel Machines
2011 · Patricia Bouyer, Nicolas Markey, et al. · Lecture notes in computer science · 19
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?
2022 · Patricia Bouyer, Paul Gastin, et al. · Lecture notes in computer science · 17
PDF
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
2018 · Christel Baier, Nathalie Bertrand, et al. · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 16
PDF
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results
2016 · Swen Jacobs, Roderick Bloem, et al. · Electronic Proceedings in Theoretical Computer Science · 15
PDF
The Second Reactive Synthesis Competition (SYNTCOMP 2015)
2016 · Swen Jacobs, Roderick Bloem, et al. · Electronic Proceedings in Theoretical Computer Science · 15
PDF
Reachability and Coverage Planning for Connected Agents
2019 · Tristan Charrier, Arthur Queffelec, et al. · International Joint Conference on Artificial Intelligence · 13
PDF
Abstraction Refinement Algorithms for Timed Automata
2019 · Victor Roussanaly, Ocan Sankur, et al. · Lecture notes in computer science · 12
PDF
Complexity of planning for connected agents
2020 · Tristan Charrier, Arthur Queffelec, et al. · Autonomous Agents and Multi-Agent Systems · 11
Symbolic Quantitative Robustness Analysis of Timed Automata
2015 · Ocan Sankur · Lecture notes in computer science · 11
Probabilistic Robust Timed Games
2014 · Youssouf Oualhadj, Pierre-Alain Reynier, et al. · Lecture notes in computer science · 11
Works count: 105
Citation count: 749
H-index: 17
I10-index: 28
Year
Topic
Type