Ocan Sankur

ORCID

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 58

Top Venues

École normale supérieure de Cachan, Paris, France (PHD)

Education History

École normale supérieure de Cachan, Paris, France

PHD

Publications

Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Complexity of planning for connected agents in a partially known environment. Theor. Comput. Sci. 941 (2023)
Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
Games on Graphs. CoRR (2023)
Isseïnie Calviac, Ocan Sankur, François Schwarzentruber
Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. AAMAS (2023)
Ocan Sankur
Timed Automata Verification and Synthesis via Finite Automata Learning. TACAS (2) (2023)
Bastien Thomas, Ocan Sankur
PyLTA: A Verification Tool for Parameterized Distributed Algorithms. TACAS (2) (2023)
Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger
Parameterized Safety Verification of Round-Based Shared-Memory Systems. ICALP (2022)
Reiya Noguchi, Ocan Sankur, Thierry Jéron, Nicolas Markey, David Mentré
Repairing Real-Time Requirements. ATVA (2022)
Jakob Piribauer, Ocan Sankur, Christel Baier
The variance-penalized stochastic shortest path problem. CoRR (2022)
Jakob Piribauer, Ocan Sankur, Christel Baier
The Variance-Penalized Stochastic Shortest Path Problem. ICALP (2022)
Aline Goeminne, Nicolas Markey, Ocan Sankur
Non-blind Strategies in Timed Network Congestion Games. FORMATS (2022)
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR (2022)
Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger
Parameterized safety verification of round-based shared-memory systems. CoRR (2022)
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS (2022)
Aline Goeminne, Nicolas Markey, Ocan Sankur
Non-Blind Strategies in Timed Network Congestion Games. CoRR (2022)
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
Semilinear Representations for Series-Parallel Atomic Congestion Games. FSTTCS (2022)
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Planning for Connected Agents in a Partially Known Environment. Canadian Conference on AI (2021)
Abdul Majith, Ocan Sankur, Hervé Marchand, Dinh Thai Bui
Compositional model checking of an SDN platform. DRCN (2021)
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Connect Multi-Agent Path Finding: Generation and Visualization. IJCAI (2021)
Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. CONCUR (2021)
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
Dynamic network congestion games. CoRR (2020)
Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, Ocan Sankur
Incremental Methods for Checking Real-Time Consistency. FORMATS (2020)
Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, Ocan Sankur
Incremental methods for checking real-time consistency. CoRR (2020)
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
Dynamic Network Congestion Games. FSTTCS (2020)
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Complexity of planning for connected agents. Auton. Agents Multi Agent Syst. 34 (2) (2020)
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Conflict-Based Search for Connected Multi-Agent Path Finding. CoRR (2020)
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Reachability and Coverage Planning for Connected Agents. IJCAI (2019)
Victor Roussanaly, Ocan Sankur, Nicolas Markey
Abstraction Refinement Algorithms for Timed Automata. CAV (1) (2019)
Victor Roussanaly, Ocan Sankur, Nicolas Markey
Abstraction Refinement Algorithms for Timed Automata. CoRR (2019)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) (2019)
Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur
Long-run Satisfaction of Path Properties. LICS (2019)
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Reachability and Coverage Planning for Connected Agents. AAMAS (2019)
Nathalie Bertrand, Benjamin Bordais, Loïc Hélouët, Thomas Mari, Julie Parreaux, Ocan Sankur
Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking. RSSRail (2019)
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
Reachability and Coverage Planning for Connected Agents: Extended Version. CoRR (2019)
Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. CoRR (2018)
Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. LICS (2018)
Mickael Randour, Jean-François Raskin, Ocan Sankur
Percentile queries in multi-dimensional Markov decision processes. Formal Methods Syst. Des. 50 (2-3) (2017)
Romain Brenguier, Jean-François Raskin, Ocan Sankur
Assume-admissible synthesis. Acta Informatica 54 (1) (2017)
Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR (2017)
Nicolas Basset, Jean-François Raskin, Ocan Sankur
Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools (2017)
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, Adam Walker
The first reactive synthesis competition (SYNTCOMP 2014). Int. J. Softw. Tools Technol. Transf. 19 (3) (2017)
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
Admissibility in Concurrent Games. CoRR (2017)
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
Admissiblity in Concurrent Games. ICALP (2017)
Ocan Sankur, Jean-Pierre Talpin
An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP. TACAS (1) (2017)
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
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. SYNT@CAV (2017)
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
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SYNT@CAV (2016)
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
Non-Zero Sum Games for Reactive Synthesis. LATA (2016)
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
Admissibility in Quantitative Graph Games. FSTTCS (2016)
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
Admissibility in Quantitative Graph Games. CoRR (2016)
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
Compositional Algorithms for Succinct Safety Games. SYNT (2015)
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
Non-Zero Sum Games for Reactive Synthesis. CoRR (2015)
Mickael Randour, Jean-François Raskin, Ocan Sankur
Percentile Queries in Multi-dimensional Markov Decision Processes. CAV (1) (2015)
Romain Brenguier, Jean-François Raskin, Ocan Sankur
Assume-Admissible Synthesis. CoRR (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, Adam Walker
The Second Reactive Synthesis Competition (SYNTCOMP 2015). SYNT (2015)
Romain Brenguier, Jean-François Raskin, Ocan Sankur
Assume-Admissible Synthesis. CONCUR (2015)
Ocan Sankur
Symbolic Quantitative Robustness Analysis of Timed Automata. TACAS (2015)
Mickael Randour, Jean-François Raskin, Ocan Sankur
Variations on the Stochastic Shortest Path Problem. VMCAI (2015)
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, Adam Walker
The First Reactive Synthesis Competition (SYNTCOMP 2014). CoRR (2015)
Patricia Bouyer, Nicolas Markey, Ocan Sankur
Robust reachability in timed automata and games: A game-based approach. Theor. Comput. Sci. 563 (2015)
Mickael Randour, Jean-François Raskin, Ocan Sankur
Percentile Queries in Multi-Dimensional Markov Decision Processes. CoRR (2014)
Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur
Probabilistic Robust Timed Games. CONCUR (2014)
Jean-François Raskin, Ocan Sankur
Multiple-Environment Markov Decision Processes. FSTTCS (2014)
Ocan Sankur, Patricia Bouyer, Nicolas Markey
Shrinking timed automata. Inf. Comput. 234 (2014)
Jean-François Raskin, Ocan Sankur
Multiple-Environment Markov Decision Processes. CoRR (2014)
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
AbsSynthe: abstract synthesis from succinct safety specifications. SYNT (2014)
Mickael Randour, Jean-François Raskin, Ocan Sankur
Variations on the Stochastic Shortest Path Problem. CoRR (2014)
Patricia Bouyer, Nicolas Markey, Ocan Sankur
Robust Weighted Timed Automata and Games. FORMATS (2013)
Ocan Sankur
Shrinktech: A Tool for the Robustness Analysis of Timed Automata. CAV (2013)
Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
Robust Controller Synthesis in Timed Automata. CONCUR (2013)
Patricia Bouyer, Nicolas Markey, Ocan Sankur
Robustness in Timed Automata. RP (2013)
Romain Brenguier, Stefan Göller, Ocan Sankur
A Comparison of Succinctly Represented Finite-State Systems. CONCUR (2012)
Patricia Bouyer, Nicolas Markey, Ocan Sankur
Robust Reachability in Timed Automata: A Game-Based Approach. ICALP (2) (2012)
Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane
Timed Automata Can Always Be Made Implementable. CONCUR (2011)
Patricia Bouyer, Nicolas Markey, Ocan Sankur
Robust Model-Checking of Timed Automata via Pumping in Channel Machines. FORMATS (2011)
Ocan Sankur, Patricia Bouyer, Nicolas Markey
Shrinking Timed Automata. FSTTCS (2011)
Ocan Sankur
Untimed Language Preservation in Timed Systems. MFCS (2011)
Claire Mathieu, Ocan Sankur, Warren Schudy
Online Correlation Clustering CoRR (2010)
Claire Mathieu, Ocan Sankur, Warren Schudy
Online Correlation Clustering. STACS (2010)

Ocan Sankur.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ocan Sankur