Proceedings of International Conference on Network Protocols (1995)

Tokyo, Japan

Nov. 7, 1995 to Nov. 10, 1995

ISBN: 0-8186-7216-1

pp: 14

Z.P. Tao , Dept. d'Inf. et de Recherche Oper., Montreal Univ., Que., Canada

G. von Bochmann , Dept. d'Inf. et de Recherche Oper., Montreal Univ., Que., Canada

R. Dssouli , Dept. d'Inf. et de Recherche Oper., Montreal Univ., Que., Canada

ABSTRACT

In protocol engineering, a common approach for system design and implementation is to verify if an implementation specification (or any lower level specification) satisfies its service specification. If an implementation specification does not satisfy its service specification, it is necessary to find out the faults and correct them. In this paper, we present an efficient algorithm for verifying whether an implementation satisfies its service specification related by the testing equivalence and the reduction relation, and generating diagnostic information if an implementation does not satisfy its service specification, based on the transformation of the service specification into a special deterministic machine, called refusal graph, and the coupled product of the refusal graph and the implementation

INDEX TERMS

protocols; formal verification; equivalence classes; telecommunication computing; conformance testing; testing equivalence; reduction relation; protocol engineering; service specification; diagnostic information; refusal graph; deterministic machine

CITATION

Z. Tao, G. von Bochmann and R. Dssouli, "Verification and diagnosis of testing equivalence and reduction relation,"

*Proceedings of International Conference on Network Protocols(ICNP)*, Tokyo, Japan, 1995, pp. 14.

doi:10.1109/ICNP.1995.524814

CITATIONS