Institutional Repository
| When equivalence and bisimulation join forces in probabilistic automata | |
| Feng, Yuan (1); Zhang, Lijun (3); Zhang, L. | |
| 2014 | |
| Conference Name | 19th International Symposium on Formal Methods, FM 2014 |
| Pages | 247-262 |
| Conference Date | May 12, 2014 - May 16, 2014 |
| Conference Place | Singapore, Singapore |
| Indexed Type | EI |
| Publish Place | Springer Verlag |
| 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 |
| 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.; 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 |
| Collection | 中国科学院软件研究所 |
| Corresponding Author | Zhang, L. |
| Recommended Citation GB/T 7714 | Feng, Yuan ,Zhang, Lijun ,Zhang, L.. When equivalence and bisimulation join forces in probabilistic automata[C]. Springer Verlag,2014:247-262. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment