Probably on time and within budget: On reachability in priced probabilistic timed automata

Jasper Berendsen, David N. Jansen, Joost-Pieter Katoen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    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.
    Original languageEnglish
    Title of host publicationThird International Conference on the Quantitative Evaluation of Systems - (QEST 2006)
    Place of PublicationLos Alamitos, CA
    PublisherIEEE Computer Society
    Pages311-322
    Number of pages12
    ISBN (Print)0-7695-2665-9
    DOIs
    Publication statusPublished - Sep 2006
    Event3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006 - University of California, Riverside, United States
    Duration: 11 Sep 200614 Sep 2006
    Conference number: 3
    http://www.qest.org/qest2006/

    Conference

    Conference3rd International Conference on Quantitative Evaluation of SysTems, QEST 2006
    Abbreviated titleQEST
    CountryUnited States
    CityRiverside
    Period11/09/0614/09/06
    Internet address

    Fingerprint Dive into the research topics of 'Probably on time and within budget: On reachability in priced probabilistic timed automata'. Together they form a unique fingerprint.

    Cite this