loading...
Verification and diagnosis of testing equivalence and reduction relation
Tokyo, Japan November 07-November 10
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNP.1995.524814Third International Conference on Net ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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
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.P. Tao, G. von Bochmann, R. Dssouli, "Verification and diagnosis of testing equivalence and reduction relation," icnp, pp.14, Third International Conference on Network Protocols (ICNP'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.