Mutually Testing Processes - (Extended 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.

[1]  Cosimo Laneve,et al.  The Must Preorder Revisited , 2007, CONCUR.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Luca Padovani Contract-based discovery of Web services modulo simple orchestrators , 2010, Theor. Comput. Sci..

[4]  Michele Bugliesi,et al.  Compliance Preorders for Web Services , 2009, WS-FM.

[5]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[6]  Frank Piessens,et al.  A programming model for concurrent object-oriented programs , 2008, TOPL.

[7]  Mario Bravetti,et al.  Contract-Based Discovery and Composition of Web Services , 2009, SFM.

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Giovanni Bernardi Behavioural equivalences for web services , 2013 .

[10]  Rocco De Nicola,et al.  CCS without tau's , 1987, TAPSOFT, Vol.1.

[11]  Ugo de'Liguoro,et al.  Two notions of sub-behaviour for session-based client/server systems , 2010, PPDP.

[12]  Arjan J. Mooij,et al.  Relating fair testing and accordance for service replaceability , 2010, J. Log. Algebraic Methods Program..

[13]  Luca Padovani,et al.  A theory of contracts for Web services , 2007, TOPL.

[14]  Cosimo Laneve,et al.  A Formal Account of Contracts for Web Services , 2006, WS-FM.

[15]  Luca Padovani,et al.  Formal Methods for Web Services: 9th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2009, Bertinoro, Italy, June 1-6, 2009, Advanced Lectures , 2009 .

[16]  Luca Padovani,et al.  Fair Subtyping for Multi-party Session Types , 2011, COORDINATION.

[17]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..