The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Detalhes bibliográficos
Main Authors:	van Breugel, F, Worrell, J
Formato:	Livro
Publicado em:	2014

Registos relacionados

On the Complexity of Computing Probabilistic Bisimilarity
Por: Chen, D, et al.
Publicado em: (2012)

Computing probabilistic bisimilarity distances for probabilistic automata
Por: Bacci, G, et al.
Publicado em: (2021)

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Por: Giorgio Bacci, et al.
Publicado em: (2021-02-01)

Deciding probabilistic bisimilarity distance one for probabilistic automata
Por: Tang, Q, et al.
Publicado em: (2020)

APPROXIMATING A BEHAVIOURAL PSEUDOMETRIC WITHOUT DISCOUNT FOR PROBABILISTIC SYSTEMS
Por: Van Breugel, F, et al.
Publicado em: (2008)

Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
Por: Franck van Breugel, et al.
Publicado em: (2008-04-01)

Game characterization of probabilistic bisimilarity, and applications to pushdown automata
Por: Forejt, V, et al.
Publicado em: (2018)

Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
Por: Vojtěch Forejt, et al.
Publicado em: (2018-11-01)

Lattice structures for bisimilar Probabilistic Automata
Por: Johann Schuster, et al.
Publicado em: (2014-02-01)

Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
Por: Wenjie Du, et al.
Publicado em: (2022-12-01)

Minimising the probabilistic bisimilarity distance
Por: Kiefer, S, et al.
Publicado em: (2024)

Expected-Delay-Summing Weak Bisimilarity for Markov Automata
Por: Alessandro Aldini, et al.
Publicado em: (2015-09-01)

On the Complexity of the Equivalence Problem for Probabilistic Automata
Por: Kiefer, S, et al.
Publicado em: (2012)

Approximating and computing behavioural distances in probabilistic transition systems
Por: van Breugel, F, et al.
Publicado em: (2006)

On-the-Fly Computation of Bisimilarity Distances
Por: Giorgio Bacci, et al.
Publicado em: (2017-06-01)

Probabilistic automata of bounded ambiguity
Por: Fijalkow, N, et al.
Publicado em: (2017)

On completeness of quasi-pseudometric spaces
Por: Seithuti P. Moshokoa
Publicado em: (2005-01-01)

★-quasi-pseudometrics on algebraic structures
Por: Shi-Yao He, et al.
Publicado em: (2023-10-01)

Language equivalence for probabilistic automata
Por: Kiefer, S, et al.
Publicado em: (2011)

When is containment decidable for probabilistic automata?
Por: Daviaud, L, et al.
Publicado em: (2018)

Codensity games for bisimilarity
Por: Komorida, Y, et al.
Publicado em: (2022)

Completeness in Quasi-Pseudometric Spaces—A Survey
Por: Ştefan Cobzas
Publicado em: (2020-08-01)

Fuzzy Cluster Analysis: Pseudometrics and Fuzzy Clusters
Por: Iryna Riasna
Publicado em: (2023-04-01)

Quasi-pseudometric properties of the Nikodym-Saks space
Por: Jesús Ferrer
Publicado em: (2003-10-01)

When are emptiness and containment decidable for probabilistic automata?
Por: Daviaud, L, et al.
Publicado em: (2021)

A Solution to the Completion Problem for Quasi-Pseudometric Spaces
Por: Athanasios Andrikopoulos
Publicado em: (2013-01-01)

Conditional Bisimilarity for Reactive Systems
Por: Mathias Hülsbusch, et al.
Publicado em: (2022-01-01)

Computing Distances between Probabilistic Automata
Por: Mathieu Tracol, et al.
Publicado em: (2011-07-01)

Best Proximity Point Theorem in Quasi-Pseudometric Spaces
Por: Robert Plebaniak
Publicado em: (2016-01-01)

Startpoints and (α,γ)-Contractions in Quasi-Pseudometric Spaces
Por: Yaé Ulrich Gaba
Publicado em: (2014-01-01)

The Strong Ekeland Variational Principle in Quasi-Pseudometric Spaces
Por: Ştefan Cobzaş
Publicado em: (2024-02-01)

Bisimilarity distances for approximate differential privacy
Por: Chistikov, D, et al.
Publicado em: (2018)

Strategies for MDP bisimilarity equivalence and inequivalence
Por: Kiefer, S, et al.
Publicado em: (2022)

Reducing Weak to Strong Bisimilarity in CCP
Por: Andrés Aristizábal, et al.
Publicado em: (2012-12-01)

New Results About Aggregation Functions of Quasi-Pseudometric Modulars
Por: Alejandro Fructuoso-Bonet, et al.
Publicado em: (2025-02-01)

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence
Por: Rob van Glabbeek, et al.
Publicado em: (2020-08-01)

Complexity of equivalence and learning for multiplicity tree automata
Por: Marusic, I, et al.
Publicado em: (2015)

Expressiveness modulo bisimilarity of regular expressions with parallel composition
Por: Baeten, JCM, et al.
Publicado em: (2015)

Compositionality for Probabilistic Automata
Por: Lynch, Nancy A., et al.
Publicado em: (2023)

Probabilistic Automata with Parameters
Por: Lenhardt, R
Publicado em: (2009)