, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8
, As soon as possible: Time optimal control for timed automata In Hybrid Systems: Computation and Control, Second International Workshop, HSCC'99, Berg en Dal, The Netherlands, Proceedings, volume 1569 of Lecture Notes in Computer Science, pp.19-30, 1999.
, Principles of model checking, 2008.
, Admissibility in concurrent games, 1702.
, UPPAAL-Tiga: Time for Playing Games!, Computer Aided Verification, 19th International Conference Proceedings, pp.121-125, 2007.
DOI : 10.1007/978-3-540-73368-3_14
URL : https://hal.archives-ouvertes.fr/hal-00350466
, Timed Automata: Semantics, Algorithms and Tools, Lectures on Concurrency and Petri Nets, pp.87-124, 2004.
DOI : 10.1007/978-3-540-27755-2_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.8701
, Admissibility in Infinite Games, Proc. of STACS, pp.188-199, 2007.
DOI : 10.1007/978-3-540-70918-3_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6338
, Computing Equilibria in Two-Player Timed Games via??Turn-Based Finite Games, Formal Modeling and Analysis of Timed Systems -8th International Conference, FORMATS 2010 Proceedings, pp.62-76, 2010.
DOI : 10.1007/978-3-642-15297-9_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.8792
, Nash Equilibria for Reachability Objectives in Multi-player Timed Games, CONCUR 2010 -Concurrency Theory, 21th International Conference, CONCUR 2010 Proceedings, pp.192-206, 2010.
DOI : 10.1007/978-3-642-15375-4_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.9212
, Non-Zero Sum Games for Reactive Synthesis, Language and Automata Theory and Applications -10th International Conference Proceedings , volume 9618 of Lecture Notes in Computer Science, pp.3-23, 2016.
DOI : 10.1007/978-3-319-30000-9_1
URL : https://hal.archives-ouvertes.fr/hal-01373546
, Admissibility in quantitative graph games, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-4214, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01373542
, Assume-admissible synthesis, Proc. of CONCUR, LIPIcs 42, pp.100-113, 2015.
DOI : 10.1111/j.1468-0262.2008.00835.x
URL : https://hal.archives-ouvertes.fr/hal-01245193
, The complexity of admissibility in Omega-regular games, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pp.1-2310, 2014.
DOI : 10.1145/2603088.2603143
URL : https://hal.archives-ouvertes.fr/hal-01161868
, Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability, 24th EACSL Annual Conference on Computer Science Logic (CSL 2015), volume 41 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.504-518
DOI : 10.1007/978-3-642-28729-9_19
, On Optimal Timed Strategies, Third International Conference Proceedings, pp.49-64, 2005.
DOI : 10.1007/11603009_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.4228
, Minimum-Time Reachability in Timed Games, Automata, Languages and Programming, 34th International Colloquium Proceedings, pp.825-837, 2007.
DOI : 10.1007/978-3-540-73420-8_71
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.2302
, Efficient On-the-Fly Algorithms for the Analysis of Timed Games, CONCUR 2005 -Concurrency Theory, 16th International Conference, CONCUR 2005 Proceedings, volume 3653 of Lecture Notes in Computer Science, pp.66-80, 2005.
DOI : 10.1007/11539452_9
URL : https://hal.archives-ouvertes.fr/hal-00350475
, Assume-Guarantee Synthesis, Tools and Algorithms for the Construction and Analysis of Systems, pp.261-275, 2007.
DOI : 10.1007/978-3-540-71209-1_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.625.9279
, Games with secure equilibria, Theoretical Computer Science, vol.365, issue.1-2, pp.67-82, 2006.
DOI : 10.1016/j.tcs.2006.07.032
URL : http://doi.org/10.1016/j.tcs.2006.07.032
, The complexity of rational synthesis, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.1-121, 2016.
, Timing assumptions and verification of finite-state concurrent systems, Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems (AVMFSS'89), pp.197-212, 1990.
DOI : 10.1007/3-540-52148-8_17
, Admissible Strategies in Infinite Games over Graphs, Proc. of MFCS, pp.307-318, 2009.
DOI : 10.1016/S0304-3975(98)00009-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.508.1600
, Rational Synthesis, Proc. of TACAS, pp.190-204, 2010.
DOI : 10.1007/978-3-642-12002-2_16
, Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization, Model Checking Software: 23rd International Symposium, SPIN 2016 Proceedings, pp.129-146, 2016.
DOI : 10.1007/978-3-319-32582-8_9
, Synthesis with rational environments, Proc. of EUMAS, pp.219-235, 2014.
DOI : 10.1007/s10472-016-9508-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.684.4968
, On the synthesis of discrete controllers for timed systems (an extended abstract), STACS, pp.229-242, 1995.
, Reasoning about strategies, Proc. of FSTTCS, LIPIcs 8, pp.133-144, 2010.
, Rational Behaviour and Strategy Construction in Infinite Multiplayer Games, FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference Proceedings, pp.212-223, 2006.
DOI : 10.1007/11944836_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.5822