CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATAReport as inadecuate




CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATA - Download this document for free, or read online. Document in PDF available to download.

Reference: Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin Norman et al., (2009). Concavely−priced probabilistic timed automata.Citable link to this page:

 

CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATA

Abstract: Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, and average price problems for concavely-priced probabilistic timed automata for arbitrary initial states. We prove that these problems are EXPTIME-complete for probabilistic timed automata with two or more clocks and PTIME-complete for automata with one clock. Previous work on expected price problems for probabilistic timed automata was restricted to expected reachability for linearly-priced automata and integer valued initial states. This work uses the boundary region graph introduced by Jurdzi�nski and Trivedi to analyse properties of concavely-priced (non-probabilistic) timed automata.

Bibliographic Details

Publisher: OUCL

Issue Date: 2009Identifiers

Urn: uuid:f5d79298-a1a4-4203-a3ef-47fb23242522 Item Description

Type: Report; Tiny URL: cs:3227

Relationships





Author: Marcin Jurdzinski - - - Marta Z. Kwiatkowska - - - Gethin Norman - - - Ashutosh Trivedi - - - - Bibliographic Details Publisher:

Source: https://ora.ox.ac.uk/objects/uuid:f5d79298-a1a4-4203-a3ef-47fb23242522



DOWNLOAD PDF




Related documents