Friendly Testing as a Conformance Relation
David de Frutos Escrig, Luis Llana, Manuel A. Nunez · 1997
In this paper we present a new kind of testing, namely friendly testing , which has been developed to obtain a satisfactory conformance relation sharing the good properties of the more popular conformance relations, that is must-testing and conf, while avoiding their respective problems. In particular, our friendly tests cannot punish a process when it is able to execute some action, while classical testing did it. This was a clear drawback of must testing when considered as a conformance relation. Finally, We prove that the preorder induced by friendly testing is just the transitive closure of conf. As a consequence we obtain an interesting characterization of this closure, from which we derive several its properties.