Journal article icon

Journal article

Expected reachability-time games

Abstract:

Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the expected time to reach a target. The two players—called player Min and player Max—compete by proposing timed moves simultaneously and the move with a shorter delay is performed. The first player attempts to minimise the given objective while the second tries t...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


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

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Name:
Engineering and Physical Sciences Research Council
Grant:
EP/M023656/1
More from this funder
Name:
European Research Council
Grant:
Advanced Grant VERIWARE
Publisher:
Elsevier
Journal:
Theoretical Computer Science More from this journal
Volume:
631
Pages:
139–160
Publication date:
2016-01-01
Acceptance date:
2016-04-15
DOI:
ISSN:
0304-3975
Keywords:
Pubs id:
pubs:615402
UUID:
uuid:0c887132-2027-4d95-ad0c-2a29acf5c9ab
Local pid:
pubs:615402
Source identifiers:
615402
Deposit date:
2016-04-15

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