Domain theory, testing and simulation for labelled Markov processes

详细信息    查看全文

• 作者：van Breugel ; Franck ; Mislove ; Michael ; Ouaknine ; Joë ; l ; Worrell ; James
• 关键词：Labelled Markov process ; Bisimulation ; Testing ; Domain theory ; Measure theory
• 刊名：Theoretical Computer Science
• 出版年：2005
• 出版时间：March 1, 2005
• 年：2005
• 卷：333
• 期：1-2
• 页码：171-197
• 全文大小：349 K

文摘

This paper presents a fundamental study of similarity and bisimilarity for labelled Markov processes (LMPs). The main results characterize similarity as a testing preorder and bisimilarity as a testing equivalence. In general, LMPs are not required to satisfy a finite-branching condition—indeed the state space may be a continuum, with the transitions given by arbitrary probability measures. Nevertheless we show that to characterize bisimilarity it suffices to use finitely-branching labelled trees as tests.