Symbolic model checking for probabilistic timed automata

DOI10.1007/978-3-540-30206-3_21MaRDI QIDQ5464754zbMATH OpenOpenAlexFDO

Authors Marta Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang

Publication date 19 August 2005

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

Full work available at URL https://doi.org/10.1007/b100824

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Symbolic model checking for probabilistic timed automata
• Model checking for probabilistic timed automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Validation of Stochastic Systems
• Model Checking Probabilistic Timed Automata with One or Two Clocks

Cited in

(28)

• On probabilistic timed automata.
• Compositional analysis of probabilistic timed graph transformation systems
• Model checking for probabilistic timed automata
• Symbolic model checking for probabilistic timed automata
• Statistical approximation of optimal schedulers for probabilistic timed automata
• Strict Divergence for Probabilistic Timed Automata
• Symbolic Simulation-Checking of Dense-Time Automata
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Simulation and Bisimulation for Probabilistic Timed Automata
• Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
• Branching-time model-checking of probabilistic pushdown automata
• Probabilistic model checking: Formalisms and algorithms for discrete and real-time systems
• Verifying quantitative properties of continuous probabilistic timed automata
• Symbolic model checking for probabilistic processes
• Symbolic verification and strategy synthesis for linearly-priced probabilistic timed automata
• Validation of Stochastic Systems
• Theoretical Aspects of Computing – ICTAC 2005
• Probabilistic and Topological Semantics for Timed Automata
• Formal Modeling and Analysis of Timed Systems
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• scientific article; zbMATH DE number 7333236 (Why is no real title available?)
• Weak bisimulation for probabilistic timed automata
• Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
• Probabilistic Metric Temporal Graph Logic
• Compositional analysis of probabilistic timed graph transformation systems
• Quantitative analysis with the probabilistic model checker PRISM
• Expressiveness and conciseness of timed automata for the verification of stochastic models
• Performance analysis of probabilistic timed automata using digital clocks

Describes a project that uses

Uses Software

• PRISM

This page was built for publication: Symbolic model checking for probabilistic timed automata

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