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...
Үндсэн зохиолчид: | van Breugel, F, Worrell, J |
---|---|
Формат: | Journal article |
Хэл сонгох: | English |
Хэвлэсэн: |
2006
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
-н: Van Breugel, F, зэрэг
Хэвлэсэн: (2008) -
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
-н: Franck van Breugel, зэрэг
Хэвлэсэн: (2008-04-01) -
On the Complexity of Computing Probabilistic Bisimilarity
-н: Chen, D, зэрэг
Хэвлэсэн: (2012) -
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
-н: van Breugel, F, зэрэг
Хэвлэсэн: (2014) -
Computing probabilistic bisimilarity distances for probabilistic automata
-н: Bacci, G, зэрэг
Хэвлэсэн: (2021)