Conference item
Revisiting reachability in timed automata
- Abstract:
-
We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a new and simpler proof of this result, building on the well-known reachability analysis of timed automata involving difference bound matrices. Using this new proof, we give an exponential-space procedure for model checking the reachability fragment of the l...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 384.4KB)
-
- Publisher copy:
- 10.1109/LICS.2017.8005098
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
Funding
Bibliographic Details
- Publisher:
- Institute of Electrical and Electronics Engineers Publisher's website
- Journal:
- Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017) Journal website
- Host title:
- Thirty-Second Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)
- Publication date:
- 2017-08-18
- Acceptance date:
- 2017-03-21
- DOI:
- ISSN:
-
1043-6871
- Source identifiers:
-
681755
Item Description
- Keywords:
- Pubs id:
-
pubs:681755
- UUID:
-
uuid:c761bf36-6ced-4ffa-91b7-a4bc146c4c97
- Local pid:
- pubs:681755
- Deposit date:
- 2018-09-05
Terms of use
- Copyright holder:
- Institute of Electrical and Electronics Engineers
- Copyright date:
- 2017
- Notes:
- ©2017 IEEE This is the accepted manuscript version of the article. The final version is available online from Institute of Electrical and Electronics Engineers at: https://doi.org/10.1109/LICS.2017.8005098
If you are the owner of this record, you can report an update to it here: Report update to this record