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

J. Berendsen, D.N. Jansen, Joost P. Katoen

    Research output: Book/ReportReportProfessional

    21 Citations (Scopus)
    26 Downloads (Pure)

    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.
    Original languageUndefined
    Place of PublicationEnschede
    PublisherCentrum voor Telematica en Informatie Technologie
    Number of pages29
    Publication statusPublished - Jun 2006

    Publication series

    NameCTIT Technical Report Series
    PublisherCentre for Telematics and Information Technology, University of Twente
    No.06-26
    ISSN (Print)1381-3625

    Keywords

    • EWI-2874
    • METIS-238644
    • IR-65646

    Cite this

    Berendsen, J., Jansen, D. N., & Katoen, J. P. (2006). Probably on time and within budget: on reachability in priced probabilistic timed automata. (CTIT Technical Report Series; No. 06-26). Enschede: Centrum voor Telematica en Informatie Technologie.