中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
characterisations of testing preorders for a finite probabilistic φ-calculus
Author: Deng Yuxin ; Tiu Alwen
Source: Formal Aspects of Computing
Issued Date: 2012
Volume: 24, Issue:41005, Pages:701-726
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
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.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/14693
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
y749884378440732.pdf(424KB)----限制开放 联系获取全文

Recommended Citation:
Deng Yuxin,Tiu Alwen. characterisations of testing preorders for a finite probabilistic φ-calculus[J]. Formal Aspects of Computing,2012-01-01,24(41005):701-726.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Deng Yuxin]'s Articles
[Tiu Alwen]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Deng Yuxin]‘s Articles
[Tiu Alwen]‘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-2021  中国科学院软件研究所 - Feedback
Powered by CSpace