Strong Connectivity Decision Method using Graph Rewriting System in Conformance Testing


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 5, pp. 1327-1336, May. 1997
10.3745/KIPSTE.1997.4.5.1327,   PDF Download:

Abstract

Test generation from the communication protocol specified in I/O FSM protocol is based on the assumption that the specifications S and implementation I are strongly connected, minimal and deterministic. In this paper, we identify why these assumptions are necessary for minimal test cases generation from I/O FSM protocol specification, and we propose a Graph Rewriting System and its application to the specification I/O FSM for verifying its strong connectivity. We prove that the suggested algorithm is more efficient than the traditional strongly connected component find algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. J. Won, K. S. Un, K. Y. Seol, "Strong Connectivity Decision Method using Graph Rewriting System in Conformance Testing," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 5, pp. 1327-1336, 1997. DOI: 10.3745/KIPSTE.1997.4.5.1327.

[ACM Style]
Lee Joon Won, Kim Sung Un, and Koo Yeon Seol. 1997. Strong Connectivity Decision Method using Graph Rewriting System in Conformance Testing. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 5, (1997), 1327-1336. DOI: 10.3745/KIPSTE.1997.4.5.1327.