Decidability and complexity results for timed automata via channel machines
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 [3] showed that the language inclusion problem is decidable if A has no clocks and undecidable if A has two clocks (with no rest...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2005
|