Abstract
We present a new testing semantics, calledfriendly testing, whose main property is that the induced preorder between processes ⊑fr is consistent with the conformance relation, and so we have, for instance,a ⊕b ⊑fr a ⊑fr a +b. The new theory is strongly based on De Nicola & Hennessy’s work on testing. Friendly tests are defined exactly as in their work, except that internal actions are not allowed. However, in order to obtain the desired notion of friendly testing this restriction is not enough and we also have to relax the conditions to pass a test. Thus we obtain a new testing semantics and a new preorder between processes which is strictly weaker than the relation ⊑must. Moreover, we present an alternative characterization of our new testing semantics by defining a modification of acceptance sets.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
de Nicola R, Hennessy M C B. Testing equivalences for processes.Theoretical Computer Science, 1984, 34: 83–133.
Hennessy M.Algebraic Theory of Processes. MIT Press, 1988.
Brinksma E, Scollo G, Steenbergen C. LOTOS specifications, their implementations and their tests. InProceedings of Protocol Specification, Testing and Verification VI, North-Holland, 1987, pp.349–360.
de Frutos-Escrig D, Llana-Díaz L F, Núñez M. Friendly testing as a conformance relation. InProceedings of Formal Description Techniques for Distributed Systems (X) and Communication Protocols, and Protocol Specification, Testing, and Verification (XVII), Chapman & Hall, 1997, pp. 283–298.
Hoare C A R.Communicating Sequential Processes. Prentice Hall, 1985.
de Frutos-Escrig D, Llana-Díaz L F, Núñez M. Introducing friendly testing. Technical Report DIA 53/97, Dept. Informática y Automática, Universidad Complutense de Madrid, 1997.
Leduc G. A framework based on implementation relations for implementing LOTOS specifications.Computer Networks and ISDN Systems 1992, 25(1): 23–41.
Hennessy M. Acceptance trees.Journal of the ACM, 1985, 32(4): 896–928.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by CICYT project TIC 97-0669-C03-01.
Or how to test processes without punishing them when they are able to execute actions.
David de Frutos-Escrig graduated in pure mathematics and computer science in 1981 from the Universidad Complutense de Madrid (UCM) and achieved the Ph.D. degree in mathematics (computer science) in 1985 with a thesis devoted to “Denotational Semantics of Probabilistic Constructions (Probabilistic Powerdomains)”. He has been a Professor since 1991 at the Computer Science Department of UCM, and heads the research group published papers on the subject.
Luis Llana-Díaz graduated in mathematics (computer science) in 1991 from the Universidad Complutense de Madrid (UCM) and achieved the Ph.D. degree in computer science with a thesis devoted to “Testing Semantics for Timed Processes Algebras” in 1996. He has been an Associate Professor since 1997 at the Computer Science Department of UCM. His main research area is formal models of concurrency and, more specifically, the semantics of timed processes.
Manuel Núñez graduated in mathematics (computer science) in 1992 from the Universidad Complutense de Madrid (UCM) and achieved the Ph.D. degree in computer science with a thesis devoted to “Testing Semantics for Probabilistic Process Algebras” in 1996. He has been an Associate Professor since 1997 at the Computer Science Department of UCM. His main research area is formal models of concurrency and, more specifically, the semantics of probabilistic processes.
Rights and permissions
About this article
Cite this article
de Frutos-Escrig, D., Llana-Díaz, L. & Núñez, M. An invitation to friendly testing. J. of Comput. Sci. & Technol. 13, 531–545 (1998). https://doi.org/10.1007/BF02946494
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02946494