Journal article
Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
- Abstract:
-
In this paper we consider the problem of computing the optimal (minimum or maximum) expected time to reach a target and the synthesis of an optimal controller for a probabilistic timed automaton (PTA). Although this problem admits solutions that employ the digital clocks abstraction or statistical model checking, symbolic methods based on zones and priced zones fail due to the difficulty of incorporating probabilistic branching in the context of dense time. We work in a generalisation of the ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 446.4KB)
-
- Publisher copy:
- 10.1016/j.tcs.2017.01.015
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:
- Elsevier Publisher's website
- Journal:
- Theoretical Computer Science Journal website
- Volume:
- 669
- Pages:
- 1–21
- Publication date:
- 2017-07-02
- Acceptance date:
- 2017-01-16
- DOI:
- ISSN:
-
0304-3975
- Source identifiers:
-
672447
Item Description
- Keywords:
- Pubs id:
-
pubs:672447
- UUID:
-
uuid:0aba8df0-db7a-463b-8e39-b2579b063e0a
- Local pid:
- pubs:672447
- Deposit date:
- 2017-01-24
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2017
- Notes:
- Copyright © 2017 Elsevier B.V. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.tcs.2017.01.015
If you are the owner of this record, you can report an update to it here: Report update to this record