Affiliation:
1. Department of Computer Science, Trinity College, Dublin 1, Ireland
Abstract
Abstract
We take a fresh look at strong probabilistic bisimulations for processes which exhibit both non-deterministic and probabilistic behaviour. We suggest that it is natural to interpret such processes as distributions over states in a probabilistic labelled transition system, a pLTS; this enables us to adapt the standard notion of contextual equivalence to this setting. We then prove that a novel form of bisimulation equivalence between distributions are both sound and complete with respect to this contextual equivalence. We also show that a very simple extension to HML, Hennessy–Milner Logic, provides finite explanations for inequivalences between distributions. Finally we show that our bisimulations between distributions in a pLTS are simply an alternative characterisation of a standard notion of probabilistic bisimulation equivalence, defined between states in a pLTS.
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science,Software
Reference29 articles.
1. Andova S (2002) Probabilistic process algebra. PhD thesis Eindhoven University of Technology
2. Deciding Bisimilarity and Similarity for Probabilistic Processes
3. Deng Y Du W (2011) Logical metric and algorithmic characterisations of probabilistic bisimulation. Technical Report CMU-CS-11-110 Carnegie Mellon University
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献