The Community for Technology Leaders
Green Image
In the article cited above, Fig. 19 (p. 69) was erroneously omitted from the final publication which appeared in TSE, vol. 30, no. 1, Jan. 2004. The textual reference to the figure is as follows:
In Step 3 of Algorithm 4 (see Fig. 19), it first adds a T-event e and its edges to $G_{MCFP}$ if e is a not-happened-before node in both $RG_1$ and $RG_2$. Then, it removes e from $RG_1$ and $RG_2$. This process continues until there does not exist any T-event which is a not-happened-before node in both $RG_1$ and $RG_2$. The algorithm shows one method of deriving the MCFP from two T-sequences, from which we can easily know that the MCFP of two T-sequences is unique. Fig. 16 shows an example for the definition of the MCFP. In the example, the MCFP has three T-events. In the extreme case, the MCFP of two T-sequences has no T-event.

Fig. 19. Algorithm 4.

    G.-H. Hwang is with the Department of Information and Computer Education, National Taiwan Normal University, 162, Hoping E RD. Sec. 1, Taipei, Taiwan 106. E-mail:

    S.-J. Chang is with Telecommunications Laboratories, Chunghwa Telecom Co., Ltd., No. 12, Lane 551, Min-Tsu Road Sec. 5 Yang-Mei, Taoyuan, Taiwan 326. E-mail:

    H.-D. Chu is with the Department of Management Information Systems, Takming College, #56, Huan Shan Rd., Sec. 1, Ney Hwu, Taipei, Taiwan 114. E-mail:

Manuscript received 1 Oct. 2002; revised 6 Nov. 2003; accepted 14 Nov. 2003.

Recommended for acceptance by J. Offutt.

For information on obtaining reprints of this article, please send e-mail to:, and reference IEEECS Log Number 117488err.


78 ms
(Ver 3.3 (11022016))