Efficient probabilistic model checking of systems with ranged probabilities

DOI10.1007/978-3-642-33512-9_10MaRDI QIDQ4899147zbMATH OpenOpenAlexFDO

Authors Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivančić, Aarti Gupta

Publication date 7 January 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-33512-9_10

Mathematics Subject Classification ID

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

Recommendations

• Model-Checking ω-Regular Properties of Interval Markov Chains
• Tools and Algorithms for the Construction and Analysis of Systems
• scientific article; zbMATH DE number 1884411
• Model checking probabilistic systems
• Verification, Model Checking, and Abstract Interpretation

Cited in

(5)

• Ensuring the reliability of your model checker: interval iteration for Markov decision processes
• Trade-off analysis meets probabilistic model checking
• scientific article; zbMATH DE number 1884411 (Why is no real title available?)
• Probabilistic black-box reachability checking (extended version)
• Verification, Model Checking, and Abstract Interpretation

Describes a project that uses

Uses Software

• APMC

This page was built for publication: Efficient probabilistic model checking of systems with ranged probabilities

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