Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
431350 | The Journal of Logic and Algebraic Programming | 2010 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics