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) -
Computing probabilistic bisimilarity distances for probabilistic automata
द्वारा: Bacci, G, और अन्य
प्रकाशित: (2021) -
Deciding probabilistic bisimilarity distance one for probabilistic automata
द्वारा: Tang, Q, और अन्य
प्रकाशित: (2020) -
On the Complexity of Computing Probabilistic Bisimilarity
द्वारा: Chen, D, और अन्य
प्रकाशित: (2012) -
The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
द्वारा: van Breugel, F, और अन्य
प्रकाशित: (2014)