A behavioural pseudometric for probabilistic transition systems

Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper, we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pse...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 331; no. 1; pp. 115 - 142
Main Authors van Breugel, Franck, Worrell, James
Format Journal Article Conference Proceeding
LanguageEnglish
Published Amsterdam Elsevier B.V 15.02.2005
Elsevier
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Discrete notions of behavioural equivalence sit uneasily with semantic models featuring quantitative data, like probabilistic transition systems. In this paper, we present a pseudometric on a class of probabilistic transition systems yielding a quantitative notion of behavioural equivalence. The pseudometric is defined via the terminal coalgebra of a functor based on a metric on the space of Borel probability measures on a metric space. States of a probabilistic transition system have distance 0 if and only if they are probabilistic bisimilar. We also characterize our distance function in terms of a real-valued modal logic.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2004.09.035