{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:12Z","timestamp":1753894392492,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T00:00:00Z","timestamp":1672876800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Variants of the must testing approach have been successfully applied in\nservice oriented computing for analysing the compliance between (contracts\nexposed by) clients and servers or, more generally, between two peers. It has\nhowever been argued that multiparty scenarios call for more permissive notions\nof compliance because partners usually do not have full coordination\ncapabilities. We propose two new testing preorders, which are obtained by\nrestricting the set of potential observers. For the first preorder, called\nuncoordinated, we allow only sets of parallel observers that use different\nparts of the interface of a given service and have no possibility of\nintercommunication. For the second preorder, that we call individualistic, we\ninstead rely on parallel observers that perceive as silent all the actions that\nare not in the interface of interest. We have that the uncoordinated preorder\nis coarser than the classical must testing preorder and finer than the\nindividualistic one. We also provide a characterisation in terms of decorated\ntraces for both preorders: the uncoordinated preorder is defined in terms of\nmust-sets and Mazurkiewicz traces while the individualistic one is described in\nterms of classes of filtered traces that only contain designated visible\nactions and must-sets.<\/jats:p>","DOI":"10.46298\/lmcs-19(1:1)2023","type":"journal-article","created":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T20:54:38Z","timestamp":1673211278000},"source":"Crossref","is-referenced-by-count":3,"title":["Multiparty testing preorders"],"prefix":"10.46298","volume":"Volume 19, Issue 1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4691-7570","authenticated-orcid":false,"given":"Rocco","family":"de Nicola","sequence":"first","affiliation":[{"name":"IMT School for Advanced Studies Lucca"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0760-0618","authenticated-orcid":false,"given":"Hern\u00e1n","family":"Melgratti","sequence":"additional","affiliation":[{"name":"DC, FCEyN, Universidad de Buenos Aires - CONICET, Argentina"}]}],"member":"25203","published-online":{"date-parts":[[2023,1,5]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/10775\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/10775\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:16:57Z","timestamp":1687292217000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,5]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(1:1)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"1612.03191v4","asserted-by":"subject"},{"id-type":"arxiv","id":"1612.03191v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1612.03191v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1612.03191v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1612.03191","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1612.03191","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2023,1,5]]},"article-number":"2598"}}