Journal article icon

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
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1016/j.tcs.2017.01.015

Authors


More by this author
Department:
Oxford, MPLS, Computer Science
More by this author
Department:
Trinity College
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
Pubs id:
pubs:672447
URN:
uri:0aba8df0-db7a-463b-8e39-b2579b063e0a
UUID:
uuid:0aba8df0-db7a-463b-8e39-b2579b063e0a
Local pid:
pubs:672447

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP