Record icon

Record

On the Undecidability of Universality for Timed Automata with Minimal Resources

Abstract:

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 considerably. Our main accomplishment is to prove that universality stays undecidable over weakly monotonic time when restricting to a single state, a single symbol and clock comparisons to 0 and 1 only. ...

Expand abstract

Actions


Authors


Publisher:
MSc Thesis
Publication date:
2006-01-01
UUID:
uuid:cbfa909a-7b0b-473c-bb11-d9396f8a0457
Local pid:
cs:770
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP