Model checking durational probabilistic systems

DOI10.1007/978-3-540-31982-5_9MaRDI QIDQ5705914zbMATH OpenOpenAlexFDO

Authors François Laroussinie, Jeremy Sproston

Publication date 10 November 2005

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

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

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Model checking of probabilistic and nondeterministic systems
• Probabilistic model checking: Formalisms and algorithms for discrete and real-time systems
• Model-checking for probabilistic real-time systems
• Symbolic model checking for probabilistic timed automata
• Model checking probabilistic systems

Cited in

(8)

• Probabilistic duration calculus for continuous time
• Computation tree measurement language (CTML)
• Multi-cost bounded tradeoff analysis in MDP
• Efficient timed model checking for discrete-time systems
• The odds of staying on budget
• Validation of Stochastic Systems
• Probabilistic model checking for energy-utility analysis
• The complexity of the Kth largest subset problem and related problems

This page was built for publication: Model checking durational probabilistic systems

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