Rocco de Nicola ; Hernán Melgratti - Multiparty testing preorders

lmcs:2598 - Logical Methods in Computer Science, January 5, 2023, Volume 19, Issue 1 -
Multiparty testing preorders

Authors: Rocco de Nicola ORCID-iD1; Hernán Melgratti ORCID-iD2

Variants of the must testing approach have been successfully applied in service oriented computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose two new testing preorders, which are obtained by restricting the set of potential observers. For the first preorder, called uncoordinated, we allow only sets of parallel observers that use different parts of the interface of a given service and have no possibility of intercommunication. For the second preorder, that we call individualistic, we instead rely on parallel observers that perceive as silent all the actions that are not in the interface of interest. We have that the uncoordinated preorder is coarser than the classical must testing preorder and finer than the individualistic one. We also provide a characterisation in terms of decorated traces for both preorders: the uncoordinated preorder is defined in terms of must-sets and Mazurkiewicz traces while the individualistic one is described in terms of classes of filtered traces that only contain designated visible actions and must-sets.

Volume: Volume 19, Issue 1
Published on: January 5, 2023
Accepted on: December 18, 2022
Submitted on: December 13, 2016
Keywords: Computer Science - Logic in Computer Science


Consultation statistics

This page has been seen 489 times.
This article's PDF has been downloaded 223 times.