On the language inclusion problem for timed automata: closing a decidability gap

We consider the language inclusion problem for timed automata: given two timed automata A and B, are all the timed traces accepted by B also accepted by A? While this problem is known to be undecidable, we show here that it becomes decidable if A is restricted to having at most one clock. This is somewhat surprising, since it is well-known that there exist timed automata with a single clock that cannot be complemented. The crux of our proof consists in reducing the language inclusion problem to a reachability question on an infinite graph; we then construct a suitable well-quasi-order on the nodes of this graph, which ensures the termination of our search algorithm. We also show that the language inclusion problem is decidable if the only constant appearing among the clock constraints of A is zero. Moreover, these two cases are essentially the only decidable instances of language inclusion, in terms of restricting the various resources of timed automata.

[1]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[2]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[3]  J. Postel.  Transmission Control Protocol , 1981, RFC.

[4]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[5]  Nancy A. Lynch,et al.  Using mappings to prove timing properties , 1990, PODC '90.

[6]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Thomas A. Henzinger,et al.  What Good Are Digital Clocks? , 1992, ICALP.

[8]  B. Jonsson,et al.  Verifying programs with unreliable channels , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[10]  Thomas A. Henzinger,et al.  A Determinizable Class of Timed Automata , 1994, CAV.

[11]  Robert K. Brayton,et al.  Verifying Abstractions of Timed Systems , 1996, CONCUR.

[12]  Parosh Aziz Abdulla,et al.  General decidability theorems for infinite-state systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[13]  Parosh Aziz Abdulla,et al.  Verifying Programs with Unreliable Channels , 1996, Inf. Comput..

[14]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[15]  Thomas A. Henzinger,et al.  Robust Timed Automata , 1997, HART.

[16]  Aziz Abdulla,et al.  Verifying Networks of Timed ProcessesParosh , 1998 .

[17]  Philippe Herrmann,et al.  Timed Automata and Recognizability , 1998, Inf. Process. Lett..

[18]  Dragan Bošnački,et al.  Digitization of Timed Automata , 1999 .

[19]  Jeff Magee,et al.  Concurrency - state models and Java programs , 2006 .

[20]  Daniel A. Spielman,et al.  An Infinite Antichain of Permutations , 2000, Electron. J. Comb..

[21]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[22]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[23]  Joël Ouaknine,et al.  Digitisation and Full Abstraction for Dense-Time Model Checking , 2002, TACAS.

[24]  Joël Ouaknine,et al.  Timed CSP = closed timed ε-automata , 2003 .

[25]  Alex Groce,et al.  Modular verification of software components in C , 2003, 25th International Conference on Software Engineering, 2003. Proceedings..

[26]  Joël Ouaknine,et al.  Revisiting digitization, robustness, and decidability for timed automata , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[27]  Joël Ouaknine,et al.  Universality and Language Inclusion for Open and Closed Timed Automata , 2003, HSCC.

[28]  Nancy A. Lynch,et al.  Timed I/O automata: a mathematical framework for modeling and analyzing real-time systems , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

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