Mutually Testing Processes

Mutually Testing Processes
复制标题

相互测试过程

DOI:
10.2168/lmcs-11(2:1)2015
复制
发表时间:
2015
期刊:
Log. Methods Comput. Sci.
影响因子:
--
通讯作者:
M. Hennessy
M. Hennessy
中科院分区:
--
文献类型:
--
作者:
G. Bernardi;M. Hennessy

文献摘要

被引文献

相似文献

在DeNicola-Hennessy的标准测试理论中,如果由前者保证的每个测试也由后者保证,则一个过程被认为是另一个过程的细化。在Web服务领域,这一点已经改变,流程被视为服务器,测试被视为客户端。通过这种方式,服务器之间的标准细化预序由它们满足客户端的能力决定。但在这种情况下,客户端之间也存在一个自然的细化预序,这取决于它们满足服务器的能力。在更一般的设置中,客户端和服务器之间没有区别,但所有进程都是对等的,基于对等体的相互满意度,存在进一步的细化预排序。我们对这三种前序给出了统一的解释。特别是我们给两个特征。第一个是行为方面的,就痕迹和现成的集合而言。第二,对于有限过程,是等式的。
In the standard testing theory of DeNicola-Hennessy one process is considered to be a refinement of another if every test guaranteed by the former is also guaranteed by the latter. In the domain of web services this has been recast, with processes viewed as servers and tests as clients. In this way the standard refinement preorder between servers is determined by their ability to satisfy clients. But in this setting there is also a natural refinement preorder between clients, determined by their ability to be satisfied by servers. In more general settings where there is no distinction between clients and servers, but all processes are peers, there is a further refinement preorder based on the mutual satisfaction of peers. We give a uniform account of these three preorders. In particular we give two characterisations. The first is behavioural, in terms of traces and ready sets. The second, for finite processes, is equational.