Expected reachability-time gamesReportar como inadecuado




Expected reachability-time games - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Reference: Forejt, V, Kwiatkowska, M, Norman, G et al., (2016). Expected reachability-time games. Theoretical Computer Science, 631, 139–160.Citable link to this page:

 

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 onsuch automata where the objective of the game is specified as the expected time to reacha target. The two players—called player Min and player Max—compete by proposingtimed moves simultaneously and the move with a shorter delay is performed. The firstplayer attempts to minimise the given objective while the second tries to maximisethe objective. We observe that these games are not determined, and study decisionproblems related to computing the upper and lower values, showing that the problemsare decidable and lie in the complexity class NEXPTIME ∩ co-NEXPTIME

Peer Review status:Peer reviewedPublication status:PublishedVersion:Publisher's version Funder: European Research Council   Funder: Engineering and Physical Sciences Research Council   Notes:Copyright © 2016 The Authors. Published by Elsevier B.V. Under a Creative Commons license.

Bibliographic Details

Publisher: Elsevier

Publisher Website: http://www.elsevier.com/

Journal: Theoretical Computer Sciencesee more from them

Publication Website: http://www.journals.elsevier.com/theoretical-computer-science/

Issue Date: 2016

pages:139–160Identifiers

Urn: uuid:0c887132-2027-4d95-ad0c-2a29acf5c9ab

Source identifier: 615402

Doi: https://doi.org/10.1016/j.tcs.2016.04.021

Issn: 0304-3975 Item Description

Type: Journal article;

Version: Publisher's versionKeywords: probabilistic timed automata two-player games competitive optimisation controller synthesis Tiny URL: pubs:615402

Relationships





Autor: Forejt, V - institutionUniversity of Oxford Oxford, MPLS, Computer Science - - - Kwiatkowska, M - institutionUniversity of Oxford

Fuente: https://ora.ox.ac.uk/objects/uuid:0c887132-2027-4d95-ad0c-2a29acf5c9ab



DESCARGAR PDF




Documentos relacionados