Concavely-Priced Probabilistic Timed Automata

DOI10.1007/978-3-642-04081-8_28MaRDI QIDQ3184689zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Concavely-Priced Timed Automata
• Priced timed automata: theory and tools
• Formal Methods for Components and Objects
• Costs and rewards in priced timed automata
• Costs and rewards in priced timed automata
• Foundations of Software Science and Computational Structures
• Optimal reachability for multi-priced timed automata
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
• Revisiting decidability and optimum reachability for multi-priced timed automata

Cites work

• A continuous-time yield management model with multiple prices and reversible price changes
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Concavely-Priced Probabilistic Timed Automata
• Concavely-Priced Timed Automata
• CONCUR 2004 - Concurrency Theory
• Critical Path Problems with Concave Cost-Time Curves
• scientific article; zbMATH DE number 3122709 (Why is no real title available?)
• scientific article; zbMATH DE number 1361118 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1796156 (Why is no real title available?)
• scientific article; zbMATH DE number 1794360 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• On probabilistic timed automata.
• Optimal infinite scheduling for multi-priced timed automata
• Optimal reachability for multi-priced timed automata
• Performance analysis of probabilistic timed automata using digital clocks
• State explosion in almost-sure probabilistic reachability
• Symbolic model checking for probabilistic timed automata
• The Complexity of Markov Decision Processes
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata

Cited in

(12)

• Model checking for probabilistic timed automata
• Consistency in parametric interval probabilistic timed automata
• Optimal reachability for multi-priced timed automata
• Expected reachability-time games
• Priced timed automata: theory and tools
• Concavely-Priced Probabilistic Timed Automata
• Concavely-Priced Timed Automata
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
• A survey of timed automata for the development of real-time systems
• Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
• Symbolic verification and strategy synthesis for linearly-priced probabilistic timed automata
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

Describes a project that uses

Uses Software

• PRISM

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

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