Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Communication and Concurrency
TAPSOFT '87/CAAP '87 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Information and Computation
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
A theory of contracts for Web services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Contract-Based Discovery and Composition of Web Services
Formal Methods for Web Services
Two notions of sub-behaviour for session-based client/server systems
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Contract-based discovery of Web services modulo simple orchestrators
Theoretical Computer Science
Compliance preorders for web services
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Fair subtyping for multi-party session types
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
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.