Computer Science – Formal Languages and Automata Theory
Scientific paper
2011-07-06
EPTCS 57, 2011, pp. 148-162
Computer Science
Formal Languages and Automata Theory
In Proceedings QAPL 2011, arXiv:1107.0746
Scientific paper
10.4204/EPTCS.57.11
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon. When epsilon is zero 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 with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bi)simulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bi)simulation, which we prove to be NP-difficult to decide.
Desharnais Josée
Tracol Mathieu
Zhioua Abir
No associations
LandOfFree
Computing Distances between Probabilistic Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing Distances between Probabilistic Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Distances between Probabilistic Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-678846