The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Bibliografske podrobnosti
Main Authors:	van Breugel, F, Worrell, J
Format:	Knjiga
Izdano:	2014

Podobne knjige/članki

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

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

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

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

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

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

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

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

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

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

Minimising the probabilistic bisimilarity distance
od: Kiefer, S, et al.
Izdano: (2024)

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

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

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

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

Probabilistic automata of bounded ambiguity
od: Fijalkow, N, et al.
Izdano: (2017)

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

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

Language equivalence for probabilistic automata
od: Kiefer, S, et al.
Izdano: (2011)

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

Codensity games for bisimilarity
od: Komorida, Y, et al.
Izdano: (2022)

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

Fuzzy Cluster Analysis: Pseudometrics and Fuzzy Clusters
od: Iryna Riasna
Izdano: (2023-04-01)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Compositionality for Probabilistic Automata
od: Lynch, Nancy A., et al.
Izdano: (2023)

Probabilistic Automata with Parameters
od: Lenhardt, R
Izdano: (2009)