Publications of Ocan Sankur

Load the BibTeX file

Academic Journals

  1. Arthur Queffelec, Ocan Sankur, Francois Schwarzentruber. Complexity of planning for connected agents in a partially known environment. Theoretical Computer Science, 941:202-220, January 2023. details doi
  2. Tristan Charrier, Arthur Queffelec, Ocan Sankur, Francois Schwarzentruber. Complexity of planning for connected agents. Autonomous Agents and Multi-Agent Systems, 34(2), October 2020. details doi pdf
  3. R. Brenguier, JF. Raskin, O. Sankur. Assume-admissible synthesis. Acta Informatica, 2016. details download pdf
  4. 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 doi
  5. 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 doi pdf
  6. Ocan Sankur, Patricia Bouyer, Nicolas Markey. Shrinking timed automata. Information and Computation, 234(0):107-132, 2014. details pdf

International Conferences

  1. Isseinie Calviac, Ocan Sankur, Francois Schwarzentruber. Improved Complexity Results and an Efficient Solution for Connected Multi-Agent Path Finding. In 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), London, United Kingdom, May 2023. details pdf
  2. Bastien Thomas, Ocan Sankur. PyLTA: A Verification Tool for Parameterized Distributed Algorithms. In TACAS 2023 - 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, April 2023. details pdf
  3. Ocan Sankur. Timed Automata Verification and Synthesis via Finite Automata Learning. In TACAS 2023 - 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, April 2023. details pdf
  4. N. Bertrand, N. Markey, S. Sadhukhan, O. Sankur. Semilinear Representations for Series-Parallel Atomic Congestion Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022), Chennai, France, December 2022. details doi
  5. R. Noguchi, O. Sankur, T. Jéron, N. Markey, D. Mentré. Repairing Real-Time Requirements. In ATVA 2022 - The 20th International Symposium on Automated Technology for Verification and Analysis, Beijing, China, October 2022. details pdf
  6. A. Goeminne, N. Markey, O. Sankur. Non-blind Strategies in Timed Network Congestion Games. In Formal Modeling and Analysis of Timed Systems. FORMATS 2022, Lecture Notes in Computer Science, Volume 13465, Pages 183-199, Warsaw, Poland, September 2022. details doi
  7. P. Bouyer, P. Gastin, F Herbreteau, O. Sankur, B. Srivathsan. Zone-based verification of timed automata: extrapolations, simulations and what next?. In FORMATS'22, 20th International Conference on Formal Modeling and Analysis of Timed Systems, Invited contribution at FORMATS'22, Warsaw, Poland, September 2022. details
  8. N. Bertrand, N. Markey, O. Sankur, N. Waldburger. Parameterized safety verification of round-based shared-memory systems. In ICALP 2022, Paris, France, July 2022. details doi
  9. Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur. Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. In CONCUR 2021 - 32nd International Conference on Concurrency Theory, Pages 1-18, Paris, France, August 2021. details doi pdf
  10. Arthur Queffelec, Ocan Sankur, Fran\c cois Schwarzentruber. Planning for Connected Agents in a Partially Known Environment. In AI 2021 - 34th Canadian Conference on Artificial Intelligence, Pages 1-23, Vancouver / Virtual, Canada, May 2021. details pdf
  11. Abdul Majith, Ocan Sankur, Hervé Marchand, Thai Dinh. Compositional model checking of an SDN platform. In DRCN 2021 - 17th International Conference on the Design of Reliable Communication Networks, Pages 1-8, Milan, Italy, April 2021. details pdf
  12. N. Bertrand, N. Markey, S. Sadhukhan, O. Sankur. Dynamic network congestion games. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), Goa, India, December 2020. details pdf
  13. T. Jéron, N. Markey, D. Mentré, R. Noguchi, O. Sankur. Incremental methods for checking real-time consistency. In FORMATS 2020 - 18th International Conference on Formal Modeling and Analysis of Timed Systems, 18 pages, published in Formats 2020, Pages 1-18, Vienne, Austria, September 2020. details pdf
  14. T. Charrier, A. Queffelec, O, Sankur, F. Schwarzentruber. Reachability and Coverage Planning for Connected Agents. In IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence, Pages 1-7, Macao, China, August 2019. details pdf
  15. D. Busatto-Gaston, B. Monmege, P.-A. Reynier, O. Sankur. Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. In CAV 2019 - 31st International Conference on Computer Aided Verification, Pages 572-590, New-York, United States, July 2019. details doi pdf
  16. Victor Roussanaly, Ocan Sankur, Nicolas Markey. Abstraction Refinement Algorithms for Timed Automata. In CAV 2019 - 31st International Conference on Computer Aided Verification, LNCS, Volume 11561, Pages 22-40, New York, United States, July 2019. details doi pdf
  17. N. Bertrand, B. Bordais, L. Hélouet, T. Mari, J. Parreaux, O. Sankur. Performance Evaluation of Metro Regulations Using Probabilistic Model-checking. In RSSRail 2019 - International conference on reliability, safety and security of railway systems: modelling, analysis, verification and certification, LNCS, Pages 1-22, Lille, France, June 2019. details pdf
  18. Ch. Baier, N. Bertrand, J. Piribauer, O. Sankur. Long-run Satisfaction of Path Properties. In LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Pages 1-31, Vancouver, Canada, June 2019. details doi pdf
  19. C. Baier, N. Bertrand, C. Dubslaff, D. Gburek, O. Sankur. Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. In LICS '18 - 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Pages 86-94, Oxford, United Kingdom, July 2018. details doi
  20. R. Brenguier, A. Pauly, J-F. Raskin, O. Sankur. Admissibility in Games with Imperfect Information. In CONCUR 2017 - 28th International Conference on Concurrency Theory, LIPICs, Volume 85, Berlin, Germany, September 2017. details doi pdf
  21. N. Basset, G. Geeraerts, J-F. Raskin, O. Sankur. Admissiblity in Concurrent Games. In ICALP 2017 - 44th International Colloquium on Automata, Languages, and Programming, LIPICs, Volume 80, Warsaw, Poland, July 2017. details doi pdf
  22. N. Basset, J.-F. Raskin, O. Sankur. Admissible Strategies in Timed Games. In Models, Algorithms, Logics and Tools. , Lecture Notes in Computer Science, Volume 10460, aalborg, Denmark, July 2017. details pdf
  23. O. Sankur, J.-P. Talpin. An Abstraction Technique For Parameterized Model Checking of Leader Election Protocols: Application to FTSP. In 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science, Volume 10206, Uppsala, Sweden, April 2017. details pdf
  24. 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
  25. 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 doi
  26. 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
  27. 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 doi
  28. 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 doi download
  29. 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 doi
  30. 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
  31. Romain Brenguier, Guillermo A. Pérez, Jean-Fran\ccois 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
  32. 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
  33. 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
  34. 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
  35. 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
  36. 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
  37. 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
  38. 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
  39. 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
  40. 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
  41. 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
  42. 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
  43. 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 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 thesis

  1. Ocan Sankur. Model-checking robuste des automates temporisés via les machines ŕ canaux. Master's theses 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