Conference item icon

Conference item

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
Division:
MPLS
Department:
Computer Science
Role:
Author
Pages:
60-69
Host title:
25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010)
Publication date:
2010-01-01
DOI:
ISSN:
1043-6871
Source identifiers:
301361
ISBN:
9780769541143
Keywords:
Pubs id:
pubs:301361
UUID:
uuid:10863637-7187-4797-8540-d8cc4d0a9337
Local pid:
pubs:301361
Deposit date:
2012-12-19

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