Probably on time and within budget – On reachability in priced probabilistic timed automata
Berendsen, J. and Jansen, D.N. and Katoen, J.P. (2006) Probably on time and within budget – On reachability in priced probabilistic timed automata. In: Quantitative Evaluation of Systems (QEST), Riverside, US (pp. pp. 311-322).
Full text not available from this repository. The author is invited to upload the full text of this publication.
|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 e¸ [0, 1]. We prove that the algorithm is partially correct and show an example for which termination cannot be guaranteed.|
|Item Type:||Conference or Workshop Item|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/63704|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page
Metis ID: 237637