Polynomial time decision algorithms for probabilistic automata (Q498403)
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: Polynomial time decision algorithms for probabilistic automata |
scientific article; zbMATH DE number 6485814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time decision algorithms for probabilistic automata |
scientific article; zbMATH DE number 6485814 |
Statements
Polynomial time decision algorithms for probabilistic automata (English)
0 references
28 September 2015
0 references
probabilistic automata
0 references
weak probabilistic bisimulation
0 references
branching probabilistic bisimulation
0 references
weak probabilistic simulation
0 references
branching probabilistic simulation
0 references
linear programming problem
0 references
polynomial decision algorithm
0 references
0.96491140127182
0 references
0.8786851763725281
0 references
0.8733695149421692
0 references
0.8496437668800354
0 references
