Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata

DOI10.1007/978-3-642-02017-9_16MaRDI QIDQ3630197zbMATH OpenOpenAlexFDO

Authors Jasper Berendsen, Taolue Chen, David N. Jansen

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)

Recommendations

• Expected reachability-price games
• Revisiting decidability and optimum reachability for multi-priced timed automata
• scientific article; zbMATH DE number 1794367
• Concavely-Priced Probabilistic Timed Automata
• Priced timed Petri nets

Cited in

(9)

• Efficient algorithms for risk-sensitive Markov decision processes with limited budget
• Model checking for probabilistic timed automata
• Expected reachability-time games
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• Symbolic minimum expected time controller synthesis for probabilistic timed automata
• Concavely-Priced Probabilistic Timed Automata
• One-clock priced timed games with negative weights
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630197)