QQ客服 官方微博 反馈留言

	When equivalence and bisimulation join forces in probabilistic automata
	Feng, Yuan (1) ; Zhang, Lijun (3)
	2014
会议名称	19th International Symposium on Formal Methods, FM 2014
会议日期	May 12, 2014 - May 16, 2014
会议地点	Singapore, Singapore
页码	247-262
通讯作者	Zhang, L.
中文摘要	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.
收录类别	EI
会议录出版地	Springer Verlag
语种	英语
ISSN号	3029743
ISBN号	9783319064093
内容类型	会议论文
源URL	[http://ir.iscas.ac.cn/handle/311060/16581]
专题	软件研究所_软件所图书馆_会议论文
推荐引用方式 GB/T 7714	Feng, Yuan ,Zhang, Lijun . When equivalence and bisimulation join forces in probabilistic automata[C]. 见:19th International Symposium on Formal Methods, FM 2014. Singapore, Singapore. May 12, 2014 - May 16, 2014.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。