Jul 6, 2011 · Abstract:We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon.
scholar.google.com › citations
Computing Distances between Probabilistic Automata easy to see that si is simulated by ti for all i = 1,2,3. Moreover, the last set of equalities shows that.
A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions and compares ...
Abstract. The problem of the computation of a distance between two probabilistic automata arises in a variety of statistical learning problems.
This paper presents an exhaustive analysis of the problem of computing the L p distance between two automata. We give efficient exact and approximate algorithms ...
Feb 2, 2021 · In this paper, we present a characterization of the bisimilarity distance as the solution of a simple stochastic game. The characterization ...
This paper presents an exhaustive analysis of the problem of computing the Lp distance of two probabilistic automata. It gives efficient exact and ...
In this paper, we present a novel characterization of the bisimilarity distance as the solution of a simple stochastic game. The characterization gives us an ...
In this paper, we present a characterization of the bisimilarity distance as the solution of a simple stochastic game. The characterization gives us an.
Jul 3, 2019 · In this paper, we present a characterization of the bisimilarity distance as the solution of a simple stochastic game.