Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata

DOI10.1007/978-3-319-22975-1_10zbMath1465.68153OpenAlexW1760491810MaRDI QIDQ2945592

Marta Kwiatkowska, Gethin Norman, Aleksandra Ž. Jovanović

Publication date: 14 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_10

Mathematics Subject Classification ID

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

Related Items (5)

Expected reachability-time games ⋮ Parameter synthesis for probabilistic timed automata using stochastic game abstractions ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Checking timed Büchi automata emptiness efficiently
• Performance analysis of probabilistic timed automata using digital clocks
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Uppaal in a nutshell
• Symbolic model checking for probabilistic timed automata
• Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata
• On Time with Minimal Expected Cost!
• Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
• Stochastic Games for Verification of Probabilistic Timed Automata
• An Analysis of Stochastic Shortest Path Problems
• An analysis of transient Markov decision processes

This page was built for publication: Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata