On the Undecidability of Universality for Timed Automata with Minimal Resources
In 1994 Alur and Dill introduced timed automata and showed that universality was undecidable there. Since then it has been shown that under certain restrictions the problem becomes decidable. But the frontier between decidability and undecidability is still vast. We aim at narrowing this gap conside...
| Tác giả chính: | |
|---|---|
| Định dạng: | Record |
| Được phát hành: |
MSc Thesis
2006
|