In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compute than (exact) bisimilarity. The main technical tool used in the underlying theory was the Hutchinson metric on probability measures. This paper gives a more fundamental characterization of approximate bisimilarity in terms of the notion of (exact) similarity. In particular, we show that the topology of approximate bisimilarity is the Lawson topology with respect to the simulation preorder. To complement this abstract characterization we give a statistical account of similarity, and by extension, of approximate bisimilarity, in terms of the process testing formalism of Larsen and Skou. © Springer-Verlag Berlin Heidelberg 2003.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Van Breugel, F., Mislove, M., Ouaknine, J., & Worrell, J. (2003). An intrinsic characterization of approximate probabilistic bisimilarity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2620, 200–215. https://doi.org/10.1007/3-540-36576-1_13