The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-06880-0_10 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W199912135 / rank | |||
Normal rank | |||
Revision as of 20:36, 19 March 2024
scientific article; zbMATH DE number 6299333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata |
scientific article; zbMATH DE number 6299333 |
Statements
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (English)
0 references
2 June 2014
0 references
