Ocan Sankur

92 papers A* 9A 5B 12C 1Journal 35Unranked 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
Linear Planar 3-SAT.
Theor. Comput. Sci.
Victorien Desbois, Ocan Sankur, François Schwarzentruber
2026 B conf
Verification of Generic VHDL Designs and Their Translation to Rocq.
VMCAI
Ocan Sankur, Benoît Boyer, Florian Faissole
2025 J jnl
Automatic assume-guarantee reasoning for safety and liveness using passive learning.
Formal Methods Syst. Des.
Ocan Sankur
2025 J jnl
Linear Planar 3-SAT and Its Applications in Planning.
CoRR
Victorien Desbois, Ocan Sankur, François Schwarzentruber
2025 J jnl
On Dynamic Programming Theory for Leader-Follower Stochastic Games.
CoRR
Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur, François Schwarzentruber
2025 — conf
Parameterized Verification of Timed Networks with Clock Invariants.
FSTTCS
Étienne André, Swen Jacobs, Shyam Lal Karra, Ocan Sankur
2025 B conf
Prompt Runtime Enforcement.
ATVA
Ayush Anand, Loïc Germerie Guizouarn, Thierry Jéron, Sayan Mukherjee, Srinivas Pinisetty, Ocan Sankur
2025 A* conf
The Value Problem for Multiple-Environment MDPs with Parity Objective.
ICALP
Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin, Ocan Sankur
2025 J jnl
The Value Problem for Multiple-Environment MDPs with Parity Objective.
CoRR
Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin, Ocan Sankur
2025 J jnl
Timed Automata Verification and Synthesis Via Finite Automata Learning.
J. Autom. Reason.
Ocan Sankur
2024 A conf
An Efficient Modular Algorithm for Connected Multi-Agent Path Finding.
ECAI
Victorien Desbois, Ocan Sankur, François Schwarzentruber
2024 J jnl
Online Test Synthesis From Requirements: Enhancing Reinforcement Learning with Game Theory.
CoRR
Ocan Sankur, Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi
2024 J jnl
Parameterized Verification of Timed Networks with Clock Invariants.
CoRR
Étienne André, Swen Jacobs, Shyam Lal Karra, Ocan Sankur
2023 J jnl
Complexity of planning for connected agents in a partially known environment.
Theor. Comput. Sci.
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2023 — book
Contributions on Formal Methods for Timed and Probabilistic Systems.
Ocan Sankur
2023 J jnl
Games on Graphs.
CoRR
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
2023 A conf
Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding.
AAMAS
Isseïnie Calviac, Ocan Sankur, François Schwarzentruber
2023 — conf
PyLTA: A Verification Tool for Parameterized Distributed Algorithms.
TACAS (2)
Bastien Thomas, Ocan Sankur
2023 — conf
Timed Automata Verification and Synthesis via Finite Automata Learning.
TACAS (2)
Ocan Sankur
2022 J jnl
Non-Blind Strategies in Timed Network Congestion Games.
CoRR
Aline Goeminne, Nicolas Markey, Ocan Sankur
2022 — conf
Non-blind Strategies in Timed Network Congestion Games.
FORMATS
Aline Goeminne, Nicolas Markey, Ocan Sankur
2022 A* conf
Parameterized Safety Verification of Round-Based Shared-Memory Systems.
ICALP
Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger
2022 J jnl
Parameterized safety verification of round-based shared-memory systems.
CoRR
Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger
2022 B conf
Repairing Real-Time Requirements.
ATVA
Reiya Noguchi, Ocan Sankur, Thierry Jéron, Nicolas Markey, David Mentré
2022 — conf
Semilinear Representations for Series-Parallel Atomic Congestion Games.
FSTTCS
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
2022 A* conf
The Variance-Penalized Stochastic Shortest Path Problem.
ICALP
Jakob Piribauer, Ocan Sankur, Christel Baier
2022 J jnl
The variance-penalized stochastic shortest path problem.
CoRR
Jakob Piribauer, Ocan Sankur, Christel Baier
2022 — conf
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next?
FORMATS
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
2022 J jnl
Zone-based verification of timed automata: extrapolations, simulations and what next?
CoRR
Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan
2021 — conf
Compositional model checking of an SDN platform.
DRCN
Abdul Majith, Ocan Sankur, Hervé Marchand, Dinh Thai Bui
2021 A* conf
Connect Multi-Agent Path Finding: Generation and Visualization.
IJCAI
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2021 — conf
Planning for Connected Agents in a Partially Known Environment.
Canadian AI
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2021 B conf
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking.
CONCUR
Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur
2020 J jnl
Complexity of planning for connected agents.
Auton. Agents Multi Agent Syst.
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2020 J jnl
Conflict-Based Search for Connected Multi-Agent Path Finding.
CoRR
Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2020 — conf
Dynamic Network Congestion Games.
FSTTCS
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
2020 J jnl
Dynamic network congestion games.
CoRR
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
2020 — conf
Incremental Methods for Checking Real-Time Consistency.
FORMATS
Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, Ocan Sankur
2020 J jnl
Incremental methods for checking real-time consistency.
CoRR
Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, Ocan Sankur
2019 — conf
Abstraction Refinement Algorithms for Timed Automata.
CAV (1)
Victor Roussanaly, Ocan Sankur, Nicolas Markey
2019 J jnl
Abstraction Refinement Algorithms for Timed Automata.
CoRR
Victor Roussanaly, Ocan Sankur, Nicolas Markey
2019 A* conf
Long-run Satisfaction of Path Properties.
LICS
Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur
2019 — conf
Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking.
RSSRail
Nathalie Bertrand, Benjamin Bordais, Loïc Hélouët, Thomas Mari, Julie Parreaux, Ocan Sankur
2019 A conf
Reachability and Coverage Planning for Connected Agents.
AAMAS
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2019 A* conf
Reachability and Coverage Planning for Connected Agents.
IJCAI
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2019 J jnl
Reachability and Coverage Planning for Connected Agents: Extended Version.
CoRR
Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber
2019 — conf
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach.
CAV (1)
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur
2018 A* conf
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes.
LICS
Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur
2018 J jnl
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes.
CoRR
Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur
2017 J jnl
Admissibility in Concurrent Games.
CoRR
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
2017 B conf
Admissibility in Games with Imperfect Information (Invited Talk).
CONCUR
Romain Brenguier, Arno Pauly, Jean-François Raskin, Ocan Sankur
2017 — conf
Admissible Strategies in Timed Games.
Models, Algorithms, Logics and Tools
Nicolas Basset, Jean-François Raskin, Ocan Sankur
2017 A* conf
Admissiblity in Concurrent Games.
ICALP
Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur
2017 — conf
An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP.
TACAS (1)
Ocan Sankur, Jean-Pierre Talpin
2017 J jnl
Assume-admissible synthesis.
Acta Informatica
Romain Brenguier, Jean-François Raskin, Ocan Sankur
2017 J jnl
Percentile queries in multi-dimensional Markov decision processes.
Formal Methods Syst. Des.
Mickael Randour, Jean-François Raskin, Ocan Sankur
2017 — conf
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results.
SYNT@CAV
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
2017 J jnl
The first reactive synthesis competition (SYNTCOMP 2014).
Int. J. Softw. Tools Technol. Transf.
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
2016 — conf
Admissibility in Quantitative Graph Games.
FSTTCS
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2016 J jnl
Admissibility in Quantitative Graph Games.
CoRR
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2016 C conf
Non-Zero Sum Games for Reactive Synthesis.
LATA
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2016 — conf
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
SYNT@CAV
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
2015 B conf
Assume-Admissible Synthesis.
CONCUR
Romain Brenguier, Jean-François Raskin, Ocan Sankur
2015 J jnl
Assume-Admissible Synthesis.
CoRR
Romain Brenguier, Jean-François Raskin, Ocan Sankur
2015 — conf
Compositional Algorithms for Succinct Safety Games.
SYNT
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2015 J jnl
Non-Zero Sum Games for Reactive Synthesis.
CoRR
Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas
2015 — conf
Percentile Queries in Multi-dimensional Markov Decision Processes.
CAV (1)
Mickael Randour, Jean-François Raskin, Ocan Sankur
2015 J jnl
Robust reachability in timed automata and games: A game-based approach.
Theor. Comput. Sci.
Patricia Bouyer, Nicolas Markey, Ocan Sankur
2015 A conf
Symbolic Quantitative Robustness Analysis of Timed Automata.
TACAS
Ocan Sankur
2015 J jnl
The First Reactive Synthesis Competition (SYNTCOMP 2014).
CoRR
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
2015 — conf
The Second Reactive Synthesis Competition (SYNTCOMP 2015).
SYNT
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
2015 B conf
Variations on the Stochastic Shortest Path Problem.
VMCAI
Mickael Randour, Jean-François Raskin, Ocan Sankur
2014 — conf
AbsSynthe: abstract synthesis from succinct safety specifications.
SYNT
Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur
2014 — conf
Multiple-Environment Markov Decision Processes.
FSTTCS
Jean-François Raskin, Ocan Sankur
2014 J jnl
Multiple-Environment Markov Decision Processes.
CoRR
Jean-François Raskin, Ocan Sankur
2014 J jnl
Percentile Queries in Multi-Dimensional Markov Decision Processes.
CoRR
Mickael Randour, Jean-François Raskin, Ocan Sankur
2014 B conf
Probabilistic Robust Timed Games.
CONCUR
Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur
2014 J jnl
Shrinking timed automata.
Inf. Comput.
Ocan Sankur, Patricia Bouyer, Nicolas Markey
2014 J jnl
Variations on the Stochastic Shortest Path Problem.
CoRR
Mickael Randour, Jean-François Raskin, Ocan Sankur
2013 B conf
Robust Controller Synthesis in Timed Automata.
CONCUR
Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier
2013 — conf
Robust Weighted Timed Automata and Games.
FORMATS
Patricia Bouyer, Nicolas Markey, Ocan Sankur
2013 — conf
Robustness in Timed Automata.
RP
Patricia Bouyer, Nicolas Markey, Ocan Sankur
2013 — —
Robustness in timed automata : analysis, synthesis, implementation. (Robustesse dans les automates temporisés : analyse, synthèse, implémentation).
Ocan Sankur
2013 A* conf
Shrinktech: A Tool for the Robustness Analysis of Timed Automata.
CAV
Ocan Sankur
2012 B conf
A Comparison of Succinctly Represented Finite-State Systems.
CONCUR
Romain Brenguier, Stefan Göller, Ocan Sankur
2012 — conf
Robust Reachability in Timed Automata: A Game-Based Approach.
ICALP (2)
Patricia Bouyer, Nicolas Markey, Ocan Sankur
2011 — conf
Robust Model-Checking of Timed Automata via Pumping in Channel Machines.
FORMATS
Patricia Bouyer, Nicolas Markey, Ocan Sankur
2011 — conf
Shrinking Timed Automata.
FSTTCS
Ocan Sankur, Patricia Bouyer, Nicolas Markey
2011 B conf
Timed Automata Can Always Be Made Implementable.
CONCUR
Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane
2011 B conf
Untimed Language Preservation in Timed Systems.
MFCS
Ocan Sankur
2010 J jnl
Online Correlation Clustering
CoRR
Claire Mathieu, Ocan Sankur, Warren Schudy
2010 A conf
Online Correlation Clustering.
STACS
Claire Mathieu, Ocan Sankur, Warren Schudy