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
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- 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
Item Description
- Keywords:
- Pubs id:
-
pubs:301361
- UUID:
-
uuid:10863637-7187-4797-8540-d8cc4d0a9337
- Local pid:
- pubs:301361
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2010
If you are the owner of this record, you can report an update to it here: Report update to this record