Mutually testing processes (extended abstract)
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(7)- On an effective hierarchy of communicating processes: Separation principle and testing
- scientific article; zbMATH DE number 1890601 (Why is no real title available?)
- Multiparty testing preorders
- Constructing weak simulations from linear implications for processes with private names
- Mutually testing processes
- Sub-behaviour relations for session-based client/server systems
- Multiparty testing preorders
This page was built for publication: Mutually testing processes (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842097)