Timed games and deterministic separability

We study a generalisation of Buchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton with epsilon transitions and only Player I can elapse time. We show that for fixed number of clocks and maximal numerical constant available to Player II, it is decidable whether she has a winning timed controller using these resources. More interestingly, we also show that the problem remains decidable even when the maximal numerical constant is not specified in advance, which is an important technical novelty not present in previous literature on timed games. We complement these two decidability result by showing undecidability when the number of clocks available to Player II is not fixed. As an application of timed games, and our main motivation to study them, we show that they can be used to solve the deterministic separability problem for nondeterministic timed automata with epsilon transitions. This is a novel decision problem about timed automata which has not been studied before. We show that separability is decidable when the number of clocks of the separating automaton is fixed and the maximal constant is not. The problem whether separability is decidable without bounding the number of clocks of the separator remains an interesting open problem.

[1]  Lorenzo Clemente,et al.  Regular Separability of Parikh Automata , 2016, ICALP.

[2]  Harry B. Hunt,et al.  On the Decidability of Grammar Problems , 1982, JACM.

[3]  Thomas Place,et al.  Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages , 2013, FSTTCS.

[4]  Thomas Place,et al.  Separating regular languages with first-order logic , 2014, CSL-LICS.

[5]  Wim Martens,et al.  Efficient Separability of Regular Languages by Subsequences and Suffixes , 2013, ICALP.

[6]  Georg Zetzsche,et al.  Regular Separability and Intersection Emptiness are Independent Problems , 2019, FSTTCS.

[7]  Brian Nielsen,et al.  Automated test generation from timed automata , 2001, International Journal on Software Tools for Technology Transfer.

[8]  Slawomir Lasota,et al.  Regular Separability of Well-Structured Transition Systems , 2018, CONCUR.

[9]  Kim G. Larsen,et al.  Efficient On-the-Fly Algorithms for the Analysis of Timed Games , 2005, CONCUR.

[10]  Marcin Jurdzinski,et al.  Comparing Timed C/E Systems with Timed Automata , 1996 .

[11]  Thomas A. Henzinger,et al.  Minimum-Time Reachability in Timed Games , 2007, ICALP.

[12]  Jean Goubault-Larrecq,et al.  Deciding Piecewise Testable Separability for Regular Tree Languages Distributed under a Creative Commons Attribution 4.0 International License Deciding Piecewise Testable Separability for Regular Tree Languages Deciding Piecewise Testable Separability for Regular Tree Languages 2 Piecewise Testable , 2022 .

[13]  Slawomir Lasota,et al.  Regular separability of one counter automata , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[14]  Cees Witteveen,et al.  An algorithm for learning real-time automata , 2007 .

[15]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[16]  M. Rabin.  Weakly Definable Relations and Special Automata , 1970 .

[17]  Paul Gastin,et al.  Analyzing Timed Systems Using Tree Automata , 2016, CONCUR.

[18]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[19]  Paul Gastin,et al.  Reachability in timed automata with diagonal constraints , 2018, CONCUR.

[20]  Thomas G. Szymanski,et al.  Noncanonical Extensions of Bottom-Up Parsing Techniques , 1976, SIAM J. Comput..

[21]  Stavros Tripakis,et al.  Folk Theorems on the Determinization and Minimization of Timed Automata , 2003, FORMATS.

[22]  Pavel Krcál,et al.  On Sampled Semantics of Timed Systems , 2005, FSTTCS.

[23]  Lorenzo Clemente,et al.  The Diagonal Problem for Higher-Order Recursion Schemes is Decidable* , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[24]  Thomas Place,et al.  Separating Regular Languages by Piecewise Testable and Unambiguous Languages , 2013, MFCS.

[25]  H. Wong-Toi,et al.  The control of dense real-time discrete event systems , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[26]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[27]  Eryk Kopczynski,et al.  Invisible Pushdown Languages , 2015, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[28]  Slawomir Lasota,et al.  Alternating timed automata , 2005, TOCL.

[29]  Wang Yi,et al.  UPPAAL 4.0 , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[30]  C.-H. Luke Ong,et al.  Unboundedness and downward closures of higher-order pushdown automata , 2015, POPL.

[31]  Wim Martens,et al.  A Note on Decidable Separability by Piecewise Testable Languages , 2014, FCT.

[32]  A. Pnueli,et al.  CONTROLLER SYNTHESIS FOR TIMED AUTOMATA , 2006 .

[33]  Hubert Comon-Lundh,et al.  Timed Automata and the Theory of Real Numbers , 1999, CONCUR.

[34]  Catalin Dima,et al.  Computing reachability relations in timed automata , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[35]  John Fearnley,et al.  Reachability in two-clock timed automata is PSPACE-complete , 2013, Inf. Comput..

[36]  Igor Walukiewicz,et al.  Better Abstractions for Timed Automata , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[37]  Lorenzo Clemente,et al.  Separability of Reachability Sets of Vector Addition Systems , 2016, STACS.

[38]  Thomas A. Henzinger,et al.  The Element of Surprise in Timed Games , 2003, CONCUR.

[39]  James Worrell,et al.  Effective Definability of the Reachability Relation in Timed Automata , 2019, Inf. Process. Lett..

[40]  Igor Walukiewicz,et al.  Revisiting local time semantics for networks of timed automata , 2019, CONCUR.

[41]  P. Madhusudan,et al.  Timed Control Synthesis for External Specifications , 2002, STACS.

[42]  Paul Gastin,et al.  Fast algorithms for handling diagonal constraints in timed automata , 2019, CAV.

[43]  Amir Pnueli,et al.  On Recognizable Timed Languages , 2004, FoSSaCS.

[44]  Yehoshua Bar-Hillel,et al.  Mathematical Logic and Foundations of Set Theory Proceedings of an International Colloquium Under the Auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11-14 November 1968 , 1970 .

[45]  Richard Mayr.  Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..

[46]  Olivier Finkel,et al.  Undecidable Problems About Timed Automata , 2006, FORMATS.

[47]  Patricia Bouyer,et al.  Fault Diagnosis Using Timed Automata , 2005, FoSSaCS.

[48]  Thomas Place,et al.  Going Higher in the First-Order Quantifier Alternation Hierarchy on Words , 2014, ICALP.

[49]  Eugene Asarin,et al.  As Soon as Possible: Time Optimal Control for Timed Automata , 1999, HSCC.

[50]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[51]  Kim G. Larsen,et al.  Time to Learn - Learning Timed Automata from Tests , 2019, FORMATS.