TY - JOUR
T1 - Relating fair testing and accordance for service replaceability
AU - Mooij, A.J.
AU - Stahl, C.
AU - Voorhoeve, M.
PY - 2010
Y1 - 2010
N2 - The accordance pre-order describes whether a service can safely be replaced by another service. That is, all partners for the original service should be partners for the new service. Partners for a service interact with the service in such a way that always a certain common goal can be reached.
We relate the accordance pre-order to the pre-orders known from the linear–branching time spectrum, notably fair testing. The differences between accordance and fair testing include the modeling of termination and success, and the parts of the services that cannot be used reliably by any partner. Apart from the theoretical results, we address the practical relevance of the introduced concepts.
AB - The accordance pre-order describes whether a service can safely be replaced by another service. That is, all partners for the original service should be partners for the new service. Partners for a service interact with the service in such a way that always a certain common goal can be reached.
We relate the accordance pre-order to the pre-orders known from the linear–branching time spectrum, notably fair testing. The differences between accordance and fair testing include the modeling of termination and success, and the parts of the services that cannot be used reliably by any partner. Apart from the theoretical results, we address the practical relevance of the introduced concepts.
U2 - 10.1016/j.jlap.2009.12.001
DO - 10.1016/j.jlap.2009.12.001
M3 - Article
SN - 1567-8326
VL - 79
SP - 233
EP - 244
JO - Journal of Logic and Algebraic Programming
JF - Journal of Logic and Algebraic Programming
IS - 3-5
ER -