Hierarchical counterexamples for discrete-time Markov chains

DOI10.1007/978-3-642-24372-1_33zbMATH Open1348.68139OpenAlexW1529165591WikidataQ57801248 ScholiaQ57801248MaRDI QIDQ3172933FDOQ3172933

Erika Ábrahám, Bernd Becker, Jens Katelaan, Ralf Wimmer, Nils Jansen, Joost-Pieter Katoen

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_33

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (4)

• Minimal counterexamples for linear-time probabilistic verification
• Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints
• On Abstraction of Probabilistic Systems
• Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey

Uses Software

• PRISM
• MRMC

   Recommendations

• Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey 👍 👎
• Minimal counterexamples for linear-time probabilistic verification 👍 👎
• Minimal Critical Subsystems for Discrete-Time Markov Models 👍 👎
• Counterexamples in Probabilistic LTL Model Checking for Markov Chains 👍 👎
• Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking 👍 👎

This page was built for publication: Hierarchical counterexamples for discrete-time Markov chains

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