Strict Divergence for Probabilistic Timed Automata

DOI10.1007/978-3-642-04081-8_41zbMath1254.68137OpenAlexW1528600913MaRDI QIDQ3184704

Jeremy Sproston

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_41

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 (3)

Tweaking the odds in probabilistic timed automata ⋮ Combined model checking for temporal, probabilistic, and real-time logics ⋮ Model checking for probabilistic timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• Checking timed Büchi automata emptiness efficiently
• State explosion in almost-sure probabilistic reachability
• Performance analysis of probabilistic timed automata using digital clocks
• A theory of timed automata
• Symbolic model checking for real-time systems
• A logic for reasoning about time and reliability
• Automatic verification of real-time systems with discrete probability distributions.
• On probabilistic timed automata.
• Real-time system = discrete system + clock variables
• Symbolic model checking for probabilistic timed automata
• Model checking of probabilistic and nondeterministic systems
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
• Alternating-time temporal logic
• Trading Infinite Memory for Uniform Randomness in Timed Games
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Computer Science Logic
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Strict Divergence for Probabilistic Timed Automata