Strong Connectivity Decision Method using Graph Rewriting System in Conformance Testing 


Vol. 4,  No. 5, pp. 1327-1336, May  1997
10.3745/KIPSTE.1997.4.5.1327


PDF
  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
  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.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals