On-the-Fly Computation of Bisimilarity Distances
We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computing it by comparing three different algorithmic methodologies: iterative, linear program, and on-the-fly. In a work presented at FoSSaCS'12, Chen et al. characterized the bisimilarity distance of Desha...
Gorde:
| Egile Nagusiak: | , , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Logical Methods in Computer Science e.V.
2017-06-01
|
| Saila: | Logical Methods in Computer Science |
| Gaiak: | |
| Sarrera elektronikoa: | https://lmcs.episciences.org/3753/pdf |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|