The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Bibliografiska uppgifter
Huvudupphovsmän:	van Breugel, F, Worrell, J
Materialtyp:	Bok
Publicerad:	2014

Liknande verk

On the Complexity of Computing Probabilistic Bisimilarity
av: Chen, D, et al.
Publicerad: (2012)

Computing probabilistic bisimilarity distances for probabilistic automata
av: Bacci, G, et al.
Publicerad: (2021)

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
av: Giorgio Bacci, et al.
Publicerad: (2021-02-01)

Deciding probabilistic bisimilarity distance one for probabilistic automata
av: Tang, Q, et al.
Publicerad: (2020)

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

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

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

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

Lattice structures for bisimilar Probabilistic Automata
av: Johann Schuster, et al.
Publicerad: (2014-02-01)

Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
av: Wenjie Du, et al.
Publicerad: (2022-12-01)

Minimising the probabilistic bisimilarity distance
av: Kiefer, S, et al.
Publicerad: (2024)

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

On the Complexity of the Equivalence Problem for Probabilistic Automata
av: Kiefer, S, et al.
Publicerad: (2012)

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

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

Probabilistic automata of bounded ambiguity
av: Fijalkow, N, et al.
Publicerad: (2017)

On completeness of quasi-pseudometric spaces
av: Seithuti P. Moshokoa
Publicerad: (2005-01-01)

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

Language equivalence for probabilistic automata
av: Kiefer, S, et al.
Publicerad: (2011)

When is containment decidable for probabilistic automata?
av: Daviaud, L, et al.
Publicerad: (2018)

Codensity games for bisimilarity
av: Komorida, Y, et al.
Publicerad: (2022)

Completeness in Quasi-Pseudometric Spaces—A Survey
av: Ştefan Cobzas
Publicerad: (2020-08-01)

Fuzzy Cluster Analysis: Pseudometrics and Fuzzy Clusters
av: Iryna Riasna
Publicerad: (2023-04-01)

Quasi-pseudometric properties of the Nikodym-Saks space
av: Jesús Ferrer
Publicerad: (2003-10-01)

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

A Solution to the Completion Problem for Quasi-Pseudometric Spaces
av: Athanasios Andrikopoulos
Publicerad: (2013-01-01)

Conditional Bisimilarity for Reactive Systems
av: Mathias Hülsbusch, et al.
Publicerad: (2022-01-01)

Computing Distances between Probabilistic Automata
av: Mathieu Tracol, et al.
Publicerad: (2011-07-01)

Best Proximity Point Theorem in Quasi-Pseudometric Spaces
av: Robert Plebaniak
Publicerad: (2016-01-01)

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

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

Bisimilarity distances for approximate differential privacy
av: Chistikov, D, et al.
Publicerad: (2018)

Strategies for MDP bisimilarity equivalence and inequivalence
av: Kiefer, S, et al.
Publicerad: (2022)

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

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

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

Complexity of equivalence and learning for multiplicity tree automata
av: Marusic, I, et al.
Publicerad: (2015)

Expressiveness modulo bisimilarity of regular expressions with parallel composition
av: Baeten, JCM, et al.
Publicerad: (2015)

Compositionality for Probabilistic Automata
av: Lynch, Nancy A., et al.
Publicerad: (2023)

Probabilistic Automata with Parameters
av: Lenhardt, R
Publicerad: (2009)