Concavely-Priced Probabilistic Timed Automata

DOI10.1007/978-3-642-04081-8_28zbMath1254.68136OpenAlexW2153675518MaRDI QIDQ3184689

Marta Kwiatkowska, Ashutosh Trivedi, Marcin Jurdziński, Gethin Norman

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_28

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (6)

Expected reachability-time games ⋮ Concavely-Priced Probabilistic Timed Automata ⋮ A survey of timed automata for the development of real-time systems ⋮ 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

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State explosion in almost-sure probabilistic reachability
• Performance analysis of probabilistic timed automata using digital clocks
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• On probabilistic timed automata.
• Symbolic model checking for probabilistic timed automata
• Optimal reachability for multi-priced timed automata
• Optimal infinite scheduling for multi-priced timed automata
• A Continuous-Time Yield Management Model with Multiple Prices and Reversible Price Changes
• Concavely-Priced Probabilistic Timed Automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Concavely-Priced Timed Automata
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
• The Complexity of Markov Decision Processes
• CONCUR 2004 - Concurrency Theory
• Critical Path Problems with Concave Cost-Time Curves

This page was built for publication: Concavely-Priced Probabilistic Timed Automata