Multiparty testing preorders
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 noti...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2023-01-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/2598/pdf |
| _version_ | 1797268483500670976 |
|---|---|
| author | Rocco de Nicola Hernán Melgratti |
| author_facet | Rocco de Nicola Hernán Melgratti |
| author_sort | Rocco de Nicola |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:33:12Z |
| format | Article |
| id | doaj.art-31459b1bed2941dda4589d81013824dd |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:33:12Z |
| publishDate | 2023-01-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-31459b1bed2941dda4589d81013824dd2024-03-08T10:41:11ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742023-01-01Volume 19, Issue 110.46298/lmcs-19(1:1)20232598Multiparty testing preordersRocco de Nicola0https://orcid.org/0000-0003-4691-7570Hernán Melgratti1https://orcid.org/0000-0003-0760-0618IMT School for Advanced Studies LuccaDC, FCEyN, Universidad de Buenos Aires - CONICET, ArgentinaVariants 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.https://lmcs.episciences.org/2598/pdfcomputer science - logic in computer science |
| spellingShingle | Rocco de Nicola Hernán Melgratti Multiparty testing preorders Logical Methods in Computer Science computer science - logic in computer science |
| title | Multiparty testing preorders |
| title_full | Multiparty testing preorders |
| title_fullStr | Multiparty testing preorders |
| title_full_unstemmed | Multiparty testing preorders |
| title_short | Multiparty testing preorders |
| title_sort | multiparty testing preorders |
| topic | computer science - logic in computer science |
| url | https://lmcs.episciences.org/2598/pdf |
| work_keys_str_mv | AT roccodenicola multipartytestingpreorders AT hernanmelgratti multipartytestingpreorders |