Efficient analysis of probabilistic programs with an unbounded counter (Q5501946)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient analysis of probabilistic programs with an unbounded counter |
scientific article; zbMATH DE number 6472760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient analysis of probabilistic programs with an unbounded counter |
scientific article; zbMATH DE number 6472760 |
Statements
Efficient Analysis of Probabilistic Programs with an Unbounded Counter (English)
0 references
14 August 2015
0 references
Markov chains
0 references
model checking
0 references
one-counter automata
0 references
0.7940417528152466
0 references
0.7927454113960266
0 references
0.7898093461990356
0 references
0.7891265749931335
0 references
0.772529125213623
0 references
