Institutional Repository
| characterisations of testing preorders for a finite probabilistic φ-calculus | |
| Deng Yuxin; Tiu Alwen | |
| 2012 | |
| Source | Formal Aspects of Computing
 |
| ISSN | 9345043 |
| Volume | 24Issue:41005Pages:701-726 |
| English Abstract | 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. |
| Indexed Type | ei |
| Department | (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 |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14693 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| y749884378440732.pdf（424KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment