Ocan Sankur

According to our database1, Ocan Sankur
  • authored at least 43 papers between 2010 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
The first reactive synthesis competition (SYNTCOMP 2014).
STTT, 2017

Percentile queries in multi-dimensional Markov decision processes.
Formal Methods in System Design, 2017

The 4th Reactive Synthesis Competition (SYNTCOMP 2017): Benchmarks, Participants & Results.
CoRR, 2017

Admissibility in Concurrent Games.
CoRR, 2017

Assume-admissible synthesis.
Acta Inf., 2017

An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Admissiblity in Concurrent Games.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Admissibility in Games with Imperfect Information (Invited Talk).
Proceedings of the 28th International Conference on Concurrency Theory, 2017

Admissible Strategies in Timed Games.
Proceedings of the Models, Algorithms, Logics and Tools, 2017

2016
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results.
Proceedings of the Proceedings Fifth Workshop on Synthesis, 2016

Admissibility in Quantitative Graph Games.
CoRR, 2016

Non-Zero Sum Games for Reactive Synthesis.
Proceedings of the Language and Automata Theory and Applications, 2016

Admissibility in Quantitative Graph Games.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Robust reachability in timed automata and games: A game-based approach.
Theor. Comput. Sci., 2015

The Second Reactive Synthesis Competition (SYNTCOMP 2015).
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

The First Reactive Synthesis Competition (SYNTCOMP 2014).
CoRR, 2015

Assume-Admissible Synthesis.
CoRR, 2015

Compositional Algorithms for Succinct Safety Games.
Proceedings of the Proceedings Fourth Workshop on Synthesis, 2015

Non-Zero Sum Games for Reactive Synthesis.
CoRR, 2015

Variations on the Stochastic Shortest Path Problem.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Symbolic Quantitative Robustness Analysis of Timed Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Assume-Admissible Synthesis.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

Percentile Queries in Multi-dimensional Markov Decision Processes.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Shrinking timed automata.
Inf. Comput., 2014

Multiple-Environment Markov Decision Processes.
CoRR, 2014

Variations on the Stochastic Shortest Path Problem.
CoRR, 2014

Percentile Queries in Multi-Dimensional Markov Decision Processes.
CoRR, 2014

AbsSynthe: abstract synthesis from succinct safety specifications.
Proceedings of the Proceedings 3rd Workshop on Synthesis, 2014

Multiple-Environment Markov Decision Processes.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Probabilistic Robust Timed Games.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013
Robustness in timed automata : analysis, synthesis, implementation. (Robustesse dans les automates temporisés : analyse, synthèse, implémentation).
PhD thesis, 2013

Robustness in Timed Automata.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

Robust Weighted Timed Automata and Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

Robust Controller Synthesis in Timed Automata.
Proceedings of the CONCUR 2013 - Concurrency Theory - 24th International Conference, 2013

Shrinktech: A Tool for the Robustness Analysis of Timed Automata.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
Robust Reachability in Timed Automata: A Game-Based Approach.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Comparison of Succinctly Represented Finite-State Systems.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Untimed Language Preservation in Timed Systems.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Shrinking Timed Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Robust Model-Checking of Timed Automata via Pumping in Channel Machines.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011

Timed Automata Can Always Be Made Implementable.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Online Correlation Clustering
CoRR, 2010

Online Correlation Clustering.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010


  Loading...