Minimal Critical Subsystems for Discrete-Time Markov Models
From MaRDI portal
Publication:2894278
DOI10.1007/978-3-642-28756-5_21zbMath1352.68167OpenAlexW1541407177WikidataQ57801097 ScholiaQ57801097MaRDI QIDQ2894278
Bernd Becker, Erika Ábrahám, Ralf Wimmer, Nils Jansen, Joost-Pieter Katoen
Publication date: 29 June 2012
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28756-5_21
Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints ⋮ On Abstraction of Probabilistic Systems ⋮ Minimal counterexamples for linear-time probabilistic verification ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey
Uses Software
This page was built for publication: Minimal Critical Subsystems for Discrete-Time Markov Models
