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 musttesting 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.
We present an extension of the classical testing semantics for the case when nondeterminism is unbounded. We define the corresponding may and must preorders in the new framework. As in the bounded setting the may preorder can be characterized by using the set of finite traces of processes. On the contrary, in order to characterize the must preorder is necessary to record some additional information about the inRnite behavior of processes. This characterization will be an extension of acceptance sets, considering not only the finite traces a process can execute but also its infinite traces.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.