Search

• < Previous
• 1
• Next >

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&nbsp;[&hellip;]