An invitation to friendly testing

Springer Science and Business Media LLC - 1998
David de Frutos-Escrig1, Luis Llana-Díaz1, Manuel Núñez1
1Dept. de Sistemas Informáticos y Programación, Universidad Complutense de Madrid, Madrid, Spain

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

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.

Thông tin
Thông tin xuất bản

Springer Science and Business Media LLC

Thông tin tác giả