The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς:	van Breugel, F, Worrell, J
Μορφή:	Βιβλίο
Έκδοση:	2014

Παρόμοια τεκμήρια

On the Complexity of Computing Probabilistic Bisimilarity
ανά: Chen, D, κ.ά.
Έκδοση: (2012)

Computing probabilistic bisimilarity distances for probabilistic automata
ανά: Bacci, G, κ.ά.
Έκδοση: (2021)

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
ανά: Giorgio Bacci, κ.ά.
Έκδοση: (2021-02-01)

Deciding probabilistic bisimilarity distance one for probabilistic automata
ανά: Tang, Q, κ.ά.
Έκδοση: (2020)

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)

Game characterization of probabilistic bisimilarity, and applications to pushdown automata
ανά: Forejt, V, κ.ά.
Έκδοση: (2018)

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
ανά: Vojtěch Forejt, κ.ά.
Έκδοση: (2018-11-01)

Lattice structures for bisimilar Probabilistic Automata
ανά: Johann Schuster, κ.ά.
Έκδοση: (2014-02-01)

Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
ανά: Wenjie Du, κ.ά.
Έκδοση: (2022-12-01)

Minimising the probabilistic bisimilarity distance
ανά: Kiefer, S, κ.ά.
Έκδοση: (2024)

Expected-Delay-Summing Weak Bisimilarity for Markov Automata
ανά: Alessandro Aldini, κ.ά.
Έκδοση: (2015-09-01)

On the Complexity of the Equivalence Problem for Probabilistic Automata
ανά: Kiefer, S, κ.ά.
Έκδοση: (2012)

Approximating and computing behavioural distances in probabilistic transition systems
ανά: van Breugel, F, κ.ά.
Έκδοση: (2006)

On-the-Fly Computation of Bisimilarity Distances
ανά: Giorgio Bacci, κ.ά.
Έκδοση: (2017-06-01)

Probabilistic automata of bounded ambiguity
ανά: Fijalkow, N, κ.ά.
Έκδοση: (2017)

On completeness of quasi-pseudometric spaces
ανά: Seithuti P. Moshokoa
Έκδοση: (2005-01-01)

★-quasi-pseudometrics on algebraic structures
ανά: Shi-Yao He, κ.ά.
Έκδοση: (2023-10-01)

Language equivalence for probabilistic automata
ανά: Kiefer, S, κ.ά.
Έκδοση: (2011)

When is containment decidable for probabilistic automata?
ανά: Daviaud, L, κ.ά.
Έκδοση: (2018)

Codensity games for bisimilarity
ανά: Komorida, Y, κ.ά.
Έκδοση: (2022)

Completeness in Quasi-Pseudometric Spaces—A Survey
ανά: Ştefan Cobzas
Έκδοση: (2020-08-01)

Fuzzy Cluster Analysis: Pseudometrics and Fuzzy Clusters
ανά: Iryna Riasna
Έκδοση: (2023-04-01)

Quasi-pseudometric properties of the Nikodym-Saks space
ανά: Jesús Ferrer
Έκδοση: (2003-10-01)

When are emptiness and containment decidable for probabilistic automata?
ανά: Daviaud, L, κ.ά.
Έκδοση: (2021)

A Solution to the Completion Problem for Quasi-Pseudometric Spaces
ανά: Athanasios Andrikopoulos
Έκδοση: (2013-01-01)

Conditional Bisimilarity for Reactive Systems
ανά: Mathias Hülsbusch, κ.ά.
Έκδοση: (2022-01-01)

Computing Distances between Probabilistic Automata
ανά: Mathieu Tracol, κ.ά.
Έκδοση: (2011-07-01)

Best Proximity Point Theorem in Quasi-Pseudometric Spaces
ανά: Robert Plebaniak
Έκδοση: (2016-01-01)

Startpoints and (α,γ)-Contractions in Quasi-Pseudometric Spaces
ανά: Yaé Ulrich Gaba
Έκδοση: (2014-01-01)

The Strong Ekeland Variational Principle in Quasi-Pseudometric Spaces
ανά: Ştefan Cobzaş
Έκδοση: (2024-02-01)

Bisimilarity distances for approximate differential privacy
ανά: Chistikov, D, κ.ά.
Έκδοση: (2018)

Strategies for MDP bisimilarity equivalence and inequivalence
ανά: Kiefer, S, κ.ά.
Έκδοση: (2022)

Reducing Weak to Strong Bisimilarity in CCP
ανά: Andrés Aristizábal, κ.ά.
Έκδοση: (2012-12-01)

New Results About Aggregation Functions of Quasi-Pseudometric Modulars
ανά: Alejandro Fructuoso-Bonet, κ.ά.
Έκδοση: (2025-02-01)

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence
ανά: Rob van Glabbeek, κ.ά.
Έκδοση: (2020-08-01)

Complexity of equivalence and learning for multiplicity tree automata
ανά: Marusic, I, κ.ά.
Έκδοση: (2015)

Expressiveness modulo bisimilarity of regular expressions with parallel composition
ανά: Baeten, JCM, κ.ά.
Έκδοση: (2015)

Compositionality for Probabilistic Automata
ανά: Lynch, Nancy A., κ.ά.
Έκδοση: (2023)

Probabilistic Automata with Parameters
ανά: Lenhardt, R
Έκδοση: (2009)