Institutional Repository
| characterisations of testing preorders for a finite probabilistic φ-calculus | |
| Deng Yuxin; Tiu Alwen | |
| 2012 | |
| 发表期刊 | Formal Aspects of Computing
![]() |
| ISSN | 9345043 |
| 卷号 | 24期号:41005页码:701-726 |
| 摘要 | We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite η-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a fragment of Milner-Parrow-Walker modal logic for the η-calculus. We base our notions of simulations on similar concepts used in previous work for probabilistic CSP. However, unlike the case with CSP (or other non-value-passing calculi), there are several possible definitions of simulation for the probabilistic η-calculus, which arise from different ways of scoping the name quantification.We show that in order to capture the testing preorders, one needs to use the "earliest" simulation relation (in analogy to the notion of early (bi)simulation in the non-probabilistic case). The key ideas in both characterisations are the notion of a "characteristic formula" of a probabilistic process, and the notion of a "characteristic test" for a formula. As in an earlier work on testing equivalence for the η-calculus by Boreale and De Nicola, we extend the language of the η-calculus with a mismatch operator, without which the formulation of a characteristic test will not be possible. © 2012 BCS. |
| 收录类别 | ei |
| 部门归属 | (1) Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (3) Research School of Computer Science, Australian National University, Canberra, Australia |
| 语种 | 英语 |
| 内容类型 | 期刊论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/14693 |
| 专题 | 中国科学院软件研究所 |
| 推荐引用方式 GB/T 7714 | Deng Yuxin,Tiu Alwen. characterisations of testing preorders for a finite probabilistic φ-calculus[J]. Formal Aspects of Computing,2012,24(41005):701-726. |
| APA | Deng Yuxin,&Tiu Alwen.(2012).characterisations of testing preorders for a finite probabilistic φ-calculus.Formal Aspects of Computing,24(41005),701-726. |
| MLA | Deng Yuxin,et al."characterisations of testing preorders for a finite probabilistic φ-calculus".Formal Aspects of Computing 24.41005(2012):701-726. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| y749884378440732.pdf(424KB) | 开放获取 | 使用许可 | 请求全文 | |||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 查看访问统计 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Deng Yuxin]的文章 |
| [Tiu Alwen]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Deng Yuxin]的文章 |
| [Tiu Alwen]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Deng Yuxin]的文章 |
| [Tiu Alwen]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论