, Optimal Reachability for Weighted Timed Games, Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp.122-133, 2004.
DOI : 10.1007/978-3-540-27836-8_13
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1201&context=cis_papers
, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8
, Optimal paths in weighted timed automata, Theoretical Computer Science, vol.318, issue.3, pp.297-322, 2004.
DOI : 10.1016/j.tcs.2003.10.038
URL : http://doi.org/10.1016/j.tcs.2003.10.038
, As Soon as Possible: Time Optimal Control for Timed Automata, Hybrid Systems: Computation and Control, pp.19-30, 1999.
DOI : 10.1007/3-540-48983-5_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.3430
, Minimum-Cost Reachability for Priced Timed Automata, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.8691
, On the optimal reachability problem of weighted timed automata. Formal Methods in System Design, pp.135-175, 2007.
, Improved undecidability results on weighted timed automata, Information Processing Letters, vol.98, issue.5, pp.188-194, 2006.
DOI : 10.1016/j.ipl.2006.01.012
URL : https://hal.archives-ouvertes.fr/hal-01194609
, Optimal infinite scheduling for multi-priced timed automata. Formal Methods in System Design, pp.3-23, 2008.
DOI : 10.1007/s10703-007-0043-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.1397
, Optimal strategies in priced timed game automata, Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pp.148-160, 2004.
DOI : 10.1007/978-3-540-30538-5_13
URL : https://hal.archives-ouvertes.fr/hal-00350483
, On the value problem in weighted timed games, Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.311-324, 2015.
, Energy and meanpayoff timed games, Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (HSCC'14), pp.283-292, 2014.
DOI : 10.1145/2562059.2562116
URL : https://hal.archives-ouvertes.fr/hal-00943015
, On Optimal Timed Strategies, Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems (FORMATS'05), pp.49-64, 2005.
DOI : 10.1007/11603009_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.4228
, Simple priced timed games are not that simple, Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), volume 45 of LIPIcs Schloss Dagstuhl?Leibniz-Zentrum für Informatik, pp.278-292, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01452621
, To reach or not to reach? Efficient algorithms for total-payoff games, Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of LIPIcs Schloss Dagstuhl?Leibniz-Zentrum für Informatik, pp.297-310, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01273475
, Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games, Acta Informatica, vol.158, issue.2, 2016.
DOI : 10.1007/s00453-016-0123-1
URL : https://hal.archives-ouvertes.fr/hal-01414114
, Adding Negative Prices to Priced Timed Games, Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pp.560-575, 2014.
DOI : 10.1007/978-3-662-44584-6_38
URL : https://hal.archives-ouvertes.fr/hal-01273480
, Optimal Reachability in Divergent Weighted Timed Games, 2017.
DOI : 10.1007/978-3-540-73420-8_72
URL : https://hal.archives-ouvertes.fr/hal-01522546
, A faster algorithm for solving one-clock priced timed games, Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), pp.531-545, 2013.
, Number of quantifiers is better than number of tape cells, Journal of Computer and System Sciences, vol.22, issue.3, pp.384-406, 1981.
DOI : 10.1016/0022-0000(81)90039-8
, Nondeterministic Space is Closed under Complementation, SIAM Journal on Computing, vol.17, issue.5, pp.935-938, 1988.
DOI : 10.1137/0217058
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4153
, Reachability-Time Games on Timed Automata, Proceedings of the 34th International Colloquium on Automata, Languages and Programming, pp.838-849, 2007.
DOI : 10.1007/978-3-540-73420-8_72
, On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction, Theory of Computing Systems, pp.204-233, 2008.
DOI : 10.1007/s00224-007-9025-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.398.4639
, Dynamical properties of timed automata. Discrete Event Dynamic Systems, pp.87-113, 2000.
, Two-Player Reachability-Price Games on Single-Clock Timed Automata, Proceedings of the Ninth Workshop on Quantitative Aspects of Programming Languages, pp.31-46, 2011.
DOI : 10.4204/EPTCS.57.3
URL : http://arxiv.org/abs/1107.1199
, The method of forced enumeration for nondeterministic automata, Acta Informatica, vol.33, issue.3, pp.279-284, 1988.
DOI : 10.1007/BF00299636