When equivalence and bisimulation join forces in probabilistic automata

ISCAS OpenIR

	When equivalence and bisimulation join forces in probabilistic automata
	Feng, Yuan (1); Zhang, Lijun (3); Zhang, L.
	2014
会议名称	19th International Symposium on Formal Methods, FM 2014
页码	247-262
会议日期	May 12, 2014 - May 16, 2014
会议地点	Singapore, Singapore
收录类别	EI
出版地	Springer Verlag
ISSN	3029743
ISBN	9783319064093
部门归属	(1) University of Technology Sydney, Australia; (2) Department of Computer Science and Technology, Tsinghua University, China; (3) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China
摘要	Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the other side, in the process algebra community, probabilistic automata were re-proposed by Segala in 1995 which are more general than Rabin's automata. Bisimulations have been proposed for Segala's automata to characterize the equivalence between them. So far the two notions of equivalences and their characteristics have been studied most independently. In this paper, we consider Segala's automata, and propose a novel notion of distribution-based bisimulation by joining the existing equivalence and bisimilarities. Our bisimulation bridges the two closely related concepts in the community, and provides a uniform way of studying their characteristics. We demonstrate the utility of our definition by studying distribution-based bisimulation metrics, which gives rise to a robust notion of equivalence for Rabin's automata. © 2014 Springer International Publishing Switzerland.; Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the other side, in the process algebra community, probabilistic automata were re-proposed by Segala in 1995 which are more general than Rabin's automata. Bisimulations have been proposed for Segala's automata to characterize the equivalence between them. So far the two notions of equivalences and their characteristics have been studied most independently. In this paper, we consider Segala's automata, and propose a novel notion of distribution-based bisimulation by joining the existing equivalence and bisimilarities. Our bisimulation bridges the two closely related concepts in the community, and provides a uniform way of studying their characteristics. We demonstrate the utility of our definition by studying distribution-based bisimulation metrics, which gives rise to a robust notion of equivalence for Rabin's automata. © 2014 Springer International Publishing Switzerland.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16581
专题	中国科学院软件研究所
通讯作者	Zhang, L.
推荐引用方式 GB/T 7714	Feng, Yuan ,Zhang, Lijun ,Zhang, L.. When equivalence and bisimulation join forces in probabilistic automata[C]. Springer Verlag,2014:247-262.