Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

DOI10.1007/978-3-319-33693-0_7zbMath1354.68172OpenAlexW2482035342MaRDI QIDQ2814125

Arnd Hartmanns, Sean Sedwards, Axel Legay, Pedro R. D'Argenio

Publication date: 17 June 2016

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

Full work available at URL: https://research.utwente.nl/en/publications/statistical-approximation-of-optimal-schedulers-for-probabilistic-timed-automata(19366aa0-8dfb-4785-a653-1814c5e1df25).html

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Tweaking the odds in probabilistic timed automata

Uses Software

• PRISM
• Uppaal
• APMC
• PLASMA
• PLASMA-lab

Cites Work

• Unnamed Item
• Unnamed Item
• Performance analysis of probabilistic timed automata using digital clocks
• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• Rare events for statistical model checking an overview
• Symbolic model checking for probabilistic timed automata
• A Platform for High Performance Statistical Model Checking – PLASMA
• Verification of Markov Decision Processes Using Learning Algorithms
• Stochastic Games for Verification of Probabilistic Timed Automata
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata