A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Decidability and Complexity Results for Timed Automata via Channel Machines
[chapter]
2005
Lecture Notes in Computer Science
This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dill [5] showed that the language inclusion problem is decidable if A has no clocks and undecidable if A has two clocks (with no restriction on B). However, the status of the problem when A has one clock is not determined by [5] . In this paper we close this gap for timed automata over infinite words by showing that the one-clock
doi:10.1007/11523468_88
fatcat:yaagqhcd6ncvbc7ri5gptos5uq