EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


2874 Probably on time and within budget: on reachability in priced probabilistic timed automata
 Home Policy Brochure Browse Search User Area Contact Help

Berendsen, J. and Jansen, D.N. and Katoen, J.P. (2006) Probably on time and within budget: on reachability in priced probabilistic timed automata. Technical Report TR-CTIT-06-26, Centre for Telematics and Information Technology University of Twente, Enschede. ISSN 1381-3625

Full text available as:

PDF
 - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
283 Kb
Exported to Metis

Abstract

This paper presents an algorithm for cost-bounded probabilistic reachability in timed automata extended with prices (on edges and locations) and discrete probabilistic branching. The algorithm determines whether the probability to reach a (set of) goal location(s) within a given price bound (and time bound) can exceed a threshold p in [0,1]. We prove that the algorithm is partially correct and show an example for which termination cannot be guaranteed.

Item Type:Internal Report (Technical Report)
Research Group:EWI-FMT: Formal Methods and Tools
Research Program:CTIT-ISTRICE: Integrated Security and Privacy in a Networked World
Research Project:Voss-2: Validation of Stochastic Systems II
ID Code:2874
Deposited On:26 July 2006
Refereed:No
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item