Minimal counterexamples for linear-time probabilistic verification (Q402125)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6334959
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal counterexamples for linear-time probabilistic verification |
scientific article; zbMATH DE number 6334959 |
Statements
Minimal counterexamples for linear-time probabilistic verification (English)
0 references
27 August 2014
0 references
Markov chain
0 references
Markov decision process
0 references
counterexample
0 references
\(\omega\)-regular property
0 references
mixed integer linear programming
0 references
SAT-modulo-theories
0 references
0 references
0.9052302241325378
0 references
0.8377288579940796
0 references
0.8249664902687073
0 references
0.8228005170822144
0 references
0.8072916269302368
0 references
