Approximating and computing behavioural distances in probabilistic transition systems
In an earlier paper we presented a pseudometric on the states of a probabilistic transition system, yielding a quantitative notion of behavioural equivalence. The behavioural pseudometric was defined via the terminal coalgebra of a functor based on a metric on Borel probability measures. In the pres...
Main Authors: | van Breugel, F, Worrell, J |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado: |
2006
|
Títulos similares
-
APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
por: Van Breugel, F, et al.
Publicado: (2008) -
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
por: Franck van Breugel, et al.
Publicado: (2008-04-01) -
On the Complexity of Computing Probabilistic Bisimilarity
por: Chen, D, et al.
Publicado: (2012) -
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
por: van Breugel, F, et al.
Publicado: (2014) -
Computing probabilistic bisimilarity distances for probabilistic automata
por: Bacci, G, et al.
Publicado: (2021)