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...
Egile Nagusiak: | van Breugel, F, Worrell, J |
---|---|
Formatua: | Journal article |
Hizkuntza: | English |
Argitaratua: |
2006
|
Antzeko izenburuak
-
APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
nork: Van Breugel, F, et al.
Argitaratua: (2008) -
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
nork: Franck van Breugel, et al.
Argitaratua: (2008-04-01) -
On the Complexity of Computing Probabilistic Bisimilarity
nork: Chen, D, et al.
Argitaratua: (2012) -
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
nork: van Breugel, F, et al.
Argitaratua: (2014) -
Computing probabilistic bisimilarity distances for probabilistic automata
nork: Bacci, G, et al.
Argitaratua: (2021)