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 |
---|---|
פורמט: | Journal article |
שפה: | English |
יצא לאור: |
2006
|
פריטים דומים
-
APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
מאת: Van Breugel, F, et al.
יצא לאור: (2008) -
Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
מאת: Franck van Breugel, et al.
יצא לאור: (2008-04-01) -
On the Complexity of Computing Probabilistic Bisimilarity
מאת: Chen, D, et al.
יצא לאור: (2012) -
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
מאת: van Breugel, F, et al.
יצא לאור: (2014) -
Computing probabilistic bisimilarity distances for probabilistic automata
מאת: Bacci, G, et al.
יצא לאור: (2021)