Publications of Ocan Sankur

Load the BibTeX file

Academic Journals

  1. R. Brenguier, JF. Raskin, O. Sankur. Assume-admissible synthesis. Acta Informatica, 2016. details Hal : Hyper Archive en ligne doi pdf
  2. S. Jacobs, R. Bloem, R. Brenguier, R. Ehlers, T. Hell, R. Konighofer, G. A. Pérez, J-F Raskin, L. Ryzhyk, O. Sankur, M. Seidl, L. Tentrup, A. Walker. The first reactive synthesis competition (SYNTCOMP 2014). International Journal on Software Tools for Technology Transfer, April 2016. details Hal : Hyper Archive en ligne doi
  3. P. Bouyer, N. Markey, O. Sankur. Robust Reachability in Timed Automata: Game-Based Approach. Journal of Theoretical Computer Science (TCS), 563:43-74, 2015. details Hal : Hyper Archive en ligne doi pdf
  4. Ocan Sankur, Patricia Bouyer, Nicolas Markey. Shrinking timed automata. Information and Computation, 234(0):107-132, 2014. details pdf

International Conferences

  1. R. Brenguier, G. Pérez, J-F Raskin, O. Sankur. Admissibility in Quantitative Graph Games. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, December 2016. details Hal : Hyper Archive en ligne
  2. R. Brenguier, J-F Raskin, O. Sankur. Assume-Admissible Synthesis. In 26th International Conference on Concurrency Theory (CONCUR 2015), Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, Pages 100-113, Madrid, Spain, September 2015. details Hal : Hyper Archive en ligne doi Arxiv
  3. R. Brenguier, G. Pérez, J-F. Raskin, O. Sankur. Compositional Algorithms for Succinct Safety Games. In 4th Workshop on Synthesis, San Francisco, United States, July 2015. details Hal : Hyper Archive en ligne
  4. M. Randour, J-F Raskin, O. Sankur. Percentile Queries in Multi-dimensional Markov Decision Processes. In 27th International Conference on Computer Aided Verification (CAV 2015), Lecture Notes in Computer Science, Volume 9206, Pages 123-139, San Francisco, United States, July 2015. details Hal : Hyper Archive en ligne doi Arxiv
  5. O. Sankur. Symbolic Quantitative Robustness Analysis of Timed Automata. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2015), Lecture Notes in Computer Science, Volume 9035, London, United Kingdom, April 2015. details Hal : Hyper Archive en ligne doi download
  6. M. Randour, J-F Raskin, O. Sankur. Variations on the Stochastic Shortest Path Problem. In Verification, Model Checking, and Abstract Interpretation, Mumbai, India, January 2015. details Hal : Hyper Archive en ligne doi
  7. Jean-Francois Raskin, Ocan Sankur. Multiple-Environment Markov Decision Processes. In 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014), Venkatesh Raman, S. P. Suresh (eds.), Leibniz International Proceedings in Informatics (LIPIcs), Volume 29, Pages 531-543, 2014. details Arxiv
  8. Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur. AbsSynthe: abstract synthesis from succinct safety specifications. In Proceedings 3rd Workshop on, Krishnendu Chatterjee, Rüdiger Ehlers, Susmit Jha (eds.), 2014. details
  9. Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur. Probabilistic Robust Timed Games. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), Paolo Baldan, Daniele Gorla (eds.), Lecture Notes in Computer Science, Volume 8704, Pages 203-217, 2014. details doi pdf
  10. Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robustness in timed automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), Parosh Aziz Abdulla, Igor Potapov (eds.), Lecture Notes in Computer Science, Volume 8169, Pages 1-18, Uppsala, Sweden, September 2013. details doi pdf
  11. Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robust Weighted Timed Automata and Games. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), V\'\ictor Braberman, Laurent Fribourg (eds.), Lecture Notes in Computer Science, Volume 8053, Pages 31-46, Buenos Aires, Argentina, August 2013. details doi pdf
  12. Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier. Robust Controller Synthesis in Timed Automata. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), Pedro R. D'Argenio, Hern\'an Melgratti (eds.), Lecture Notes in Computer Science, Volume 8052, Pages 546-560, Buenos Aires, Argentina, August 2013. details doi pdf
  13. Ocan Sankur. Shrinktech: A Tool for the Robustness Analysis of Timed Automata. In Proceedings of the 23th International Conference on Computer Aided Verification (CAV'13), Natasha Sharygina, Helmut Veith (eds.), Lecture Notes in Computer Science, Volume 8044, Pages 1006-1012, Saint Petersburg, Russia, July 2013. details pdf
  14. Romain Brenguier, Stefan Göller, Ocan Sankur. A Comparison of Succinctly Represented Finite-State Systems. In Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), Maciej Koutny, Irek Ulidowski (eds.), Lecture Notes in Computer Science, Volume 7454, Pages 147-161, Newcastle, UK, September 2012. details doi pdf
  15. Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robust Reachability in Timed Automata: A Game-based Approach. In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12) - Part II, Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, Roger Wattenhofer (eds.), Lecture Notes in Computer Science, Volume 7392, Pages 128-140, Warwick, UK, July 2012. details doi pdf
  16. Ocan Sankur, Patricia Bouyer, Nicolas Markey. Shrinking Timed Automata. In Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Supratik Chakraborty, Amit Kumar (eds.), Leibniz International Proceedings in Informatics, Pages 90-102, Mumbai, India, December 2011. details doi pdf
  17. Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus Thrane. Timed automata can always be made implementable. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), Joost-Pieter Katoen, Barbara König (eds.), Lecture Notes in Computer Science, Volume 6901, Pages 76-91, Aachen, Germany, September 2011. details doi pdf
  18. Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robust Model-Checking of Timed Automata via Pumping in Channel Machines. In Proceedings of the 9th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'11), Uli Fahrenberg, Stavros Tripakis (eds.), Lecture Notes in Computer Science, Volume 6919, Pages 97-112, Aalborg, Denmark, September 2011. details doi pdf
  19. Ocan Sankur. Untimed Language Preservation in Timed Systems. In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), Filip Murlak, Piotr Sankowski (eds.), Lecture Notes in Computer Science, Volume 6907, Pages 556-567, Warsaw, Poland, August 2011. details doi pdf
  20. Claire Mathieu, Ocan Sankur, Warren Schudy. Online correlation clustering. In Proceedings of the 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS'10), Jean-Yves Marion, Thomas Schwentick (eds.), Leibniz International Proceedings in Informatics, Volume 5, Pages 573-584, Nancy, France, March 2010. details doi pdf

Invited Conferences

  1. R. Brenguier, L. Clemente, P. Hunter, G. Pérez, M. Randour, JF. Raskin, O. Sankur, M. Sassolas. Non-Zero Sum Games for Reactive Synthesis. In Language and Automata Theory and Applications, Prague, Czech Republic, March 2016. details Hal : Hyper Archive en ligne doi

Thesis

  1. Ocan Sankur. Robustness in Timed Automata: Analysis, Synthesis, Implementation. PhD Thesis Laboratoire Spécification et Vérification, ENS Cachan, France, June 2013. details pdf

Master's theses

  1. Ocan Sankur. Model-checking robuste des automates temporisés via les machines ŕ canaux. Master's thesis Ecole Normale Supérieure, Paris, France, September 2010. details

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic