Hierarchical counterexamples for discrete-time Markov chains

DOI10.1007/978-3-642-24372-1_33MaRDI QIDQ3172933zbMATH OpenOpenAlexWikidataFDO

Authors Nils Jansen, Erika Ábrahám, Jens Katelaan, Ralf Wimmer, Bernd Becker, 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)

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

Cited in

(7)

• On Abstraction of Probabilistic Systems
• Providing Evidence of Likely Being on Time: Counterexample Generation for CTMC Model Checking
• Minimal counterexamples for linear-time probabilistic verification
• Counterexamples in Probabilistic LTL Model Checking for Markov Chains
• Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking
• Counterexample generation for discrete-time Markov models: an introductory survey
• Farkas certificates and minimal witnesses for probabilistic reachability constraints

Describes a project that uses

Uses Software

• PRISM
• MRMC

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)