On the Complexity of Computing Probabilistic Bisimilarity (Q2892788)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Computing Probabilistic Bisimilarity |
scientific article |
Statements
On the Complexity of Computing Probabilistic Bisimilarity (English)
0 references
22 June 2012
0 references
