Probabilistic timed automata with one clock and initialised clock-dependent probabilities

DOI10.1007/978-3-030-50086-3_9MaRDI QIDQ5041280zbMATH OpenOpenAlexFDO

Authors Jeremy Sproston

Publication date 13 October 2022

Published in Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-50086-3_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Markov and semi-Markov decision processes (90C40)

Recommendations

• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• On probabilistic timed automata.

Cites work

• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Bounded-parameter Markov decision processes
• CONCUR 2004 - Concurrency Theory
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Interval iteration algorithm for MDPs and IMDPs
• Interval-valued finite Markov chains
• Model checking for probabilistic timed automata
• Model checking of open interval Markov chains
• Model Checking One-clock Priced Timed Automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Model Checking Real-Time Systems
• Model-Checking ω-Regular Properties of Interval Markov Chains
• On the complexity of model checking interval-valued discrete time Markov chains
• Polynomial-time verification of PCTL properties of MDPs with convex uncertainties
• Probabilistic bisimulations for PCTL model checking of interval MDPs
• Probabilistic timed automata with one clock and initialised clock-dependent probabilities
• Qualitative reachability for open interval Markov chains
• Quantitative multi-objective verification for probabilistic systems
• Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
• Robust Control of Markov Decision Processes with Uncertain Transition Matrices
• Stochastic timed automata
• Stochastic timed games revisited
• The Complexity of Markov Decision Processes
• The complexity of reachability in parametric Markov decision processes
• Tools and Algorithms for the Construction and Analysis of Systems
• What's decidable about hybrid automata?

Cited in

(1)

• Probabilistic timed automata with one clock and initialised clock-dependent probabilities

This page was built for publication: Probabilistic timed automata with one clock and initialised clock-dependent probabilities

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