中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
When equivalence and bisimulation join forces in probabilistic automata
Author: Feng, Yuan (1) ; Zhang, Lijun (3)
Conference Name: 19th International Symposium on Formal Methods, FM 2014
Conference Date: May 12, 2014 - May 16, 2014
Issued Date: 2014
Conference Place: Singapore, Singapore
Corresponding Author: Zhang, L.
Publish Place: Springer Verlag
Indexed Type: EI
ISSN: 3029743
ISBN: 9783319064093
Department: (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
Abstract: 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.
English Abstract: 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.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16581
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Feng, Yuan (1)]'s Articles
[Zhang, Lijun (3)]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Feng, Yuan (1)]‘s Articles
[Zhang, Lijun (3)]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace