The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata

Bibliographic Details
Main Authors:	van Breugel, F, Worrell, J
Format:	Book
Published:	2014

Similar Items

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

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

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

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

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

Minimising the probabilistic bisimilarity distance
by: Kiefer, S, et al.
Published: (2024)

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

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

Probabilistic automata of bounded ambiguity
by: Fijalkow, N, et al.
Published: (2017)

Language equivalence for probabilistic automata
by: Kiefer, S, et al.
Published: (2011)

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

Codensity games for bisimilarity
by: Komorida, Y, et al.
Published: (2022)

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

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

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

Compositionality for Probabilistic Automata
by: Lynch, Nancy A., et al.
Published: (2023)

Probabilistic Automata with Parameters
by: Lenhardt, R
Published: (2009)

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

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

Language Equivalence for Probabilistic Automata
by: Wachter, J
Published: (2011)

Probabilistic automata and stochastic languages
by: Soh, Royson Jun Heng
Published: (2024)

Convex language semantics for nondeterministic probabilistic automata
by: Van Heerdt, G, et al.
Published: (2018)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
by: Kiefer, S, et al.
Published: (2013)

A characterisation of open bisimilarity using an intuitionistic modal logic
by: Ahrn, Ki Yung, et al.
Published: (2018)

Concavely−Priced Probabilistic Timed Automata
by: Kwiatkowska, G, et al.
Published: (2009)

CONCAVELY−PRICED PROBABILISTIC TIMED AUTOMATA
by: Jurdzinski, M, et al.
Published: (2009)

Two Undecidability Results in Probabilistic Automata Theory
by: Kilian, Joseph J.
Published: (2023)

Decidability and complexity results for timed automata via channel machines
by: Abdulla, P, et al.
Published: (2005)

Convenient categories of processes and simulations I: modulo strong bisimilarity
by: Pavlovic, D
Published: (1995)

Model-based estimation of probabilistic hybrid automata
by: Henry, Melvin Michael, 1968-
Published: (2013)

Task-Structured Probabilistic I/O Automata
by: Canetti,, Ran, et al.
Published: (2006)

Task-structured probabilistic I/O automata
by: Canetti, Ran, et al.
Published: (2021)

Task-Structured Probabilistic I/O Automata
by: Canetti, Ran, et al.
Published: (2006)

Two undecidability results in probabilistic automata theory
by: Kilian, Joe.
Published: (2020)

Task-Structured Probabilistic I/O Automata
by: Canetti, Ran, et al.
Published: (2013)

Convenient categories of processes and simulations II: modulo weak and branching bisimilarities
by: Pavlovic, D
Published: (1996)

Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
by: Jovanovic, A, et al.
Published: (2017)

Minimisation of multiplicity tree automata
by: Worrell, J, et al.
Published: (2017)

Branching-Time Model-Checking of Probabilistic Pushdown Automata.
by: Brázdil, T, et al.
Published: (2009)

Accurate belief state update for probabilistic constraint automata
by: Martin, Oliver B., 1979-
Published: (2006)