Ratio and Weight Quantiles

Krähmann, Daniel; Schubert, Jana; Baier, Christel; Dubslaff, Clemens

doi:10.1007/978-3-662-48057-1_27

Search citation statements

Order By: Relevance

Paper Sections

Select...

The (How To Check) Properties Landscape1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

2018

Publication Types

Select...

Other3

Book2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Conditional probabilities like [♦G|♦F ] >1/2 can be efficiently dealt with using a copy-construction of the Markov model [24] or by path reductions [68]. Other properties include PCTL on MDPs with fairness constraints [12], verifying Markov chains against push-down specifications [74], and quantiles [122,160]. Counterexample generation-how to generate diagnostic feedback in case a property is violated?-for Markov chains is surveyed in [3].…”

Section: The (How To Check) Properties Landscapementioning

confidence: 99%

The Probabilistic Model Checking Landscape

Katoen

2016

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

128

View full text Add to dashboard Cite

Randomization is a key element in sequential and distributed computing. Reasoning about randomized algorithms is highly nontrivial. In the 1980s, this initiated first proof methods, logics, and model-checking algorithms. The field of probabilistic verification has developed considerably since then. This paper surveys the algorithmic verification of probabilistic models, in particular probabilistic model checking. We provide an informal account of the main models, the underlying algorithms, applications from reliability and dependability analysis-and beyond-and describe recent developments towards automated parameter synthesis.

show abstract