Conference icon

Conference

Alternating Timed Automata over Bounded Time

Abstract:

Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, in providing verification algorithms for prominent specification formalisms such as Metric Temporal Logic. Unfortunately, when interpreted over an infinite dense time domain (such as the reals), alternating timed automata have an undecidable language emptiness problem. The main result of this paper is that, over boun...

Expand abstract
Publication status:
Published

Actions


Access Document


Publisher copy:
10.1109/LICS.2010.45

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Pages:
60-69
Publication date:
2010-01-01
DOI:
ISSN:
1043-6871
URN:
uuid:10863637-7187-4797-8540-d8cc4d0a9337
Source identifiers:
301361
Local pid:
pubs:301361
ISBN:
978-0-7695-4114-3

Terms of use


Metrics


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