default search action
Ocan Sankur
Person information
- affiliation: University of Rennes, France
- affiliation: Inria, Rennes, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c51]Victorien Desbois, Ocan Sankur, François Schwarzentruber:
An Efficient Modular Algorithm for Connected Multi-Agent Path Finding. ECAI 2024: 3364-3371 - [i22]Ocan Sankur, Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi:
Online Test Synthesis From Requirements: Enhancing Reinforcement Learning with Game Theory. CoRR abs/2407.18994 (2024) - [i21]Étienne André, Swen Jacobs, Shyam Lal Karra, Ocan Sankur:
Parameterized Verification of Timed Networks with Clock Invariants. CoRR abs/2408.05190 (2024) - 2023
- [b2]Ocan Sankur:
Contributions on Formal Methods for Timed and Probabilistic Systems. University of Rennes 1, France, 2023 - [j7]Arthur Queffelec, Ocan Sankur
, François Schwarzentruber:
Complexity of planning for connected agents in a partially known environment. Theor. Comput. Sci. 941: 202-220 (2023) - [c50]Isseïnie Calviac, Ocan Sankur, François Schwarzentruber:
Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. AAMAS 2023: 896-904 - [c49]Bastien Thomas, Ocan Sankur:
PyLTA: A Verification Tool for Parameterized Distributed Algorithms. TACAS (2) 2023: 28-35 - [c48]Ocan Sankur:
Timed Automata Verification and Synthesis via Finite Automata Learning. TACAS (2) 2023: 329-349 - [i20]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 abs/2305.10546 (2023) - 2022
- [c47]Reiya Noguchi, Ocan Sankur, Thierry Jéron, Nicolas Markey, David Mentré:
Repairing Real-Time Requirements. ATVA 2022: 371-387 - [c46]Patricia Bouyer
Zone-Based Verification of Timed Automata: Extrapolations, Simulations and What Next? FORMATS 2022: 16-42 - [c45]Aline Goeminne, Nicolas Markey, Ocan Sankur:
Non-blind Strategies in Timed Network Congestion Games. FORMATS 2022: 183-199 - [c44]Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Semilinear Representations for Series-Parallel Atomic Congestion Games. FSTTCS 2022: 32:1-32:20 - [c43]Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger:
Parameterized Safety Verification of Round-Based Shared-Memory Systems. ICALP 2022: 113:1-113:20 - [c42]Jakob Piribauer
The Variance-Penalized Stochastic Shortest Path Problem. ICALP 2022: 129:1-129:19 - [i19]Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger:
Parameterized safety verification of round-based shared-memory systems. CoRR abs/2204.11670 (2022) - [i18]Jakob Piribauer
The variance-penalized stochastic shortest path problem. CoRR abs/2204.12280 (2022) - [i17]Aline Goeminne, Nicolas Markey, Ocan Sankur:
Non-Blind Strategies in Timed Network Congestion Games. CoRR abs/2207.01537 (2022) - [i16]Patricia Bouyer, Paul Gastin, Frédéric Herbreteau, Ocan Sankur, B. Srivathsan:
Zone-based verification of timed automata: extrapolations, simulations and what next? CoRR abs/2207.07479 (2022) - 2021
- [c41]Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Planning for Connected Agents in a Partially Known Environment. Canadian AI 2021 - [c40]Jakob Piribauer
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. CONCUR 2021: 7:1-7:18 - [c39]Abdul Majith, Ocan Sankur, Hervé Marchand, Dinh Thai Bui:
Compositional model checking of an SDN platform. DRCN 2021: 1-8 - [c38]Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Connect Multi-Agent Path Finding: Generation and Visualization. IJCAI 2021: 5008-5011 - 2020
- [j6]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Complexity of planning for connected agents. Auton. Agents Multi Agent Syst. 34(2): 44 (2020) - [c37]Thierry Jéron
Incremental Methods for Checking Real-Time Consistency. FORMATS 2020: 249-264 - [c36]Nathalie Bertrand
Dynamic Network Congestion Games. FSTTCS 2020: 40:1-40:16 - [i15]Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Conflict-Based Search for Connected Multi-Agent Path Finding. CoRR abs/2006.03280 (2020) - [i14]Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, Ocan Sankur
Incremental methods for checking real-time consistency. CoRR abs/2007.01014 (2020) - [i13]Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Dynamic network congestion games. CoRR abs/2009.13632 (2020)
2010 – 2019
- 2019
- [c35]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Reachability and Coverage Planning for Connected Agents. AAMAS 2019: 1874-1876 - [c34]Victor Roussanaly, Ocan Sankur, Nicolas Markey:
Abstraction Refinement Algorithms for Timed Automata. CAV (1) 2019: 22-40 - [c33]Damien Busatto-Gaston
Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. CAV (1) 2019: 572-590 - [c32]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Reachability and Coverage Planning for Connected Agents. IJCAI 2019: 144-150 - [c31]Christel Baier
Long-run Satisfaction of Path Properties. LICS 2019: 1-14 - [c30]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: 59-76 - [i12]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Reachability and Coverage Planning for Connected Agents: Extended Version. CoRR abs/1903.04300 (2019) - [i11]Victor Roussanaly, Ocan Sankur, Nicolas Markey:
Abstraction Refinement Algorithms for Timed Automata. CoRR abs/1905.07365 (2019) - 2018
- [c29]Christel Baier
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. LICS 2018: 86-94 - [i10]Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur:
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. CoRR abs/1804.11301 (2018) - 2017
- [j5]Romain Brenguier, Jean-François Raskin
Assume-admissible synthesis. Acta Informatica 54(1): 41-83 (2017) - [j4]Mickael Randour, Jean-François Raskin
Percentile queries in multi-dimensional Markov decision processes. Formal Methods Syst. Des. 50(2-3): 207-248 (2017) - [j3]Swen Jacobs
The first reactive synthesis competition (SYNTCOMP 2014). Int. J. Softw. Tools Technol. Transf. 19(3): 367-390 (2017) - [c28]Nicolas Basset, Jean-François Raskin
Admissible Strategies in Timed Games. Models, Algorithms, Logics and Tools 2017: 403-425 - [c27]Romain Brenguier, Arno Pauly
Admissibility in Games with Imperfect Information (Invited Talk). CONCUR 2017: 2:1-2:23 - [c26]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin
Admissiblity in Concurrent Games. ICALP 2017: 123:1-123:14 - [c25]Ocan Sankur, Jean-Pierre Talpin:
An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP. TACAS (1) 2017: 23-40 - [c24]Swen Jacobs
The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results. SYNT@CAV 2017: 116-143 - [i9]Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur:
Admissibility in Concurrent Games. CoRR abs/1702.06439 (2017) - 2016
- [c23]Romain Brenguier, Guillermo A. Pérez
Admissibility in Quantitative Graph Games. FSTTCS 2016: 42:1-42:14 - [c22]Romain Brenguier, Lorenzo Clemente, Paul Hunter
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - [c21]Swen Jacobs
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SYNT@CAV 2016: 149-177 - [i8]Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. CoRR abs/1611.08677 (2016) - 2015
- [j2]Patricia Bouyer, Nicolas Markey
Robust reachability in timed automata and games: A game-based approach. Theor. Comput. Sci. 563: 43-74 (2015) - [c20]Mickael Randour, Jean-François Raskin
Percentile Queries in Multi-dimensional Markov Decision Processes. CAV (1) 2015: 123-139 - [c19]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CONCUR 2015: 100-113 - [c18]Ocan Sankur:
Symbolic Quantitative Robustness Analysis of Timed Automata. TACAS 2015: 484-498 - [c17]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. VMCAI 2015: 1-18 - [c16]Swen Jacobs
The Second Reactive Synthesis Competition (SYNTCOMP 2015). SYNT 2015: 27-57 - [c15]Romain Brenguier, Guillermo A. Pérez
Compositional Algorithms for Succinct Safety Games. SYNT 2015: 98-111 - [i7]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 abs/1506.08726 (2015) - [i6]Romain Brenguier, Jean-François Raskin, Ocan Sankur:
Assume-Admissible Synthesis. CoRR abs/1507.00623 (2015) - [i5]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 abs/1512.05568 (2015) - 2014
- [j1]Ocan Sankur, Patricia Bouyer, Nicolas Markey
Shrinking timed automata. Inf. Comput. 234: 107-132 (2014) - [c14]Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur:
Probabilistic Robust Timed Games. CONCUR 2014: 203-217 - [c13]Jean-François Raskin, Ocan Sankur:
Multiple-Environment Markov Decision Processes. FSTTCS 2014: 531-543 - [c12]Romain Brenguier, Guillermo A. Pérez
AbsSynthe: abstract synthesis from succinct safety specifications. SYNT 2014: 100-116 - [i4]Jean-François Raskin, Ocan Sankur:
Multiple-Environment Markov Decision Processes. CoRR abs/1405.4733 (2014) - [i3]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Percentile Queries in Multi-Dimensional Markov Decision Processes. CoRR abs/1410.4801 (2014) - [i2]Mickael Randour, Jean-François Raskin, Ocan Sankur:
Variations on the Stochastic Shortest Path Problem. CoRR abs/1411.0835 (2014) - 2013
- [b1]Ocan Sankur:
Robustness in timed automata : analysis, synthesis, implementation. (Robustesse dans les automates temporisés : analyse, synthèse, implémentation). École normale supérieure de Cachan, Paris, France, 2013 - [c11]Ocan Sankur:
Shrinktech: A Tool for the Robustness Analysis of Timed Automata. CAV 2013: 1006-1012 - [c10]Ocan Sankur, Patricia Bouyer, Nicolas Markey
Robust Controller Synthesis in Timed Automata. CONCUR 2013: 546-560 - [c9]Patricia Bouyer, Nicolas Markey
Robust Weighted Timed Automata and Games. FORMATS 2013: 31-46 - [c8]Patricia Bouyer, Nicolas Markey
Robustness in Timed Automata. RP 2013: 1-18 - 2012
- [c7]Romain Brenguier, Stefan Göller, Ocan Sankur:
A Comparison of Succinctly Represented Finite-State Systems. CONCUR 2012: 147-161 - [c6]Patricia Bouyer, Nicolas Markey
Robust Reachability in Timed Automata: A Game-Based Approach. ICALP (2) 2012: 128-140 - 2011
- [c5]Patricia Bouyer, Kim G. Larsen
Timed Automata Can Always Be Made Implementable. CONCUR 2011: 76-91 - [c4]Patricia Bouyer, Nicolas Markey
Robust Model-Checking of Timed Automata via Pumping in Channel Machines. FORMATS 2011: 97-112 - [c3]Ocan Sankur, Patricia Bouyer, Nicolas Markey:
Shrinking Timed Automata. FSTTCS 2011: 90-102 - [c2]Ocan Sankur:
Untimed Language Preservation in Timed Systems. MFCS 2011: 556-567 - 2010
- [c1]Claire Mathieu, Ocan Sankur, Warren Schudy:
Online Correlation Clustering. STACS 2010: 573-584 - [i1]Claire Mathieu, Ocan Sankur, Warren Schudy:
Online Correlation Clustering. CoRR abs/1001.0920 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: