Computing Distances between Probabilistic Automata
نویسندگان
چکیده
منابع مشابه
Computing Distances between Probabilistic Automata
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error ε . When ε = 0 we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L and L ¬, by the modal operator. Using flow networks, we show how to compute the r...
متن کاملOn the Computation of Some Standard Distances Between Probabilistic Automata
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 Lp distance between two automata. We give efficient exact and approximate algorithms for computing these distances for p even and prove the problem to be NP-hard for all odd values of p, t...
متن کاملProbabilistic Distances Between Trees
Most existing measures of distance between phylogenetic trees are based on the geometry or topology of the trees. Instead, we consider distance measures which are based on the underlying probability distributions on genetic sequence data induced by trees. Monte Carlo schemes are necessary to calculate these distances approximately, and we describe efficient sampling procedures. Key features of ...
متن کاملComputing with Probabilistic Cellular Automata
We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic cellular automata rule is able to solve the density classification problem, i.e. classifies binary input strings according to the number of 1’s and 0’s in the string, and show that its computational abilities are related to critic...
متن کاملComputing Probabilistic Bisimilarity Distances via Policy Iteration
A transformation mapping a labelled Markov chain to a simple stochastic game is presented. In the resulting simple stochastic game, each vertex corresponds to a pair of states of the labelled Markov chain. The value of a vertex of the simple stochastic game is shown to be equal to the probabilistic bisimilarity distance, a notion due to Desharnais, Gupta, Jagadeesan and Panangaden, of the corre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.57.11