Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata

DOI10.1007/978-3-642-02017-9_16zbMath1241.68076OpenAlexW1710323894MaRDI QIDQ3630197

David N. Jansen, Jasper Berendsen, Taolue Chen

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

Expected reachability-time games ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata ⋮ Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties ⋮ Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata ⋮ Model checking for probabilistic timed automata ⋮ Unnamed Item ⋮ Efficient algorithms for risk-sensitive Markov decision processes with limited budget

This page was built for publication: Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata