×

An invitation to friendly testing. (English) Zbl 0912.68127

Summary: We present a new testing semantics, called friendly testing, whose main property is that the included preorder between processes \(\sqsubseteq_{\text{fr}}\) is consistent with the conformance relation, and so we have, for instance, \(a\oplus b\sqsubseteq_{\text{fr}} a\sqsubseteq_{\text{fr}} a+b\). The new theory is strongly based on De Nicola and Hennessy’s work on testing [R. de Nicola and M. C. B. Hennessy, Testing equivalences for processes. Theor. Comput. Sci. 34, 83-133 (1984; Zbl 0985.68518)]. 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 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 \(\sqsubseteq_{\text{must}}\). Moreover, we present an alternative characterization of our new testing semantics by defining a modification of acceptance sets.

MSC:

68Q55 Semantics in the theory of computing
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

Citations:

Zbl 0985.68518
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] de Nicola R, Hennessy M C B. Testing equivalences for processes.Theoretical Computer Science, 1984, 34: 83–133. · Zbl 0985.68518 · doi:10.1016/0304-3975(84)90113-0
[2] Hennessy M.Algebraic Theory of Processes. MIT Press, 1988. · Zbl 0744.68047
[3] 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.
[4] 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.
[5] Hoare C A R.Communicating Sequential Processes. Prentice Hall, 1985. · Zbl 0637.68007
[6] 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.
[7] Leduc G. A framework based on implementation relations for implementing LOTOS specifications.Computer Networks and ISDN Systems 1992, 25(1): 23–41. · Zbl 0789.68095 · doi:10.1016/0169-7552(92)90122-7
[8] Hennessy M. Acceptance trees.Journal of the ACM, 1985, 32(4): 896–928. · Zbl 0633.68074 · doi:10.1145/4221.4249
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.