Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains (Q5111641)
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: Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains |
scientific article; zbMATH DE number 7204944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains |
scientific article; zbMATH DE number 7204944 |
Statements
27 May 2020
0 references
labelled Markov chain
0 references
probabilistic bisimilarity
0 references
pseudometric
0 references
policy iteration
0 references
0.903601348400116
0 references
0.8528745770454407
0 references
0.8497095704078674
0 references
0.8330886960029602
0 references
0.8282319903373718
0 references
