In Step 3 of Algorithm 4 (see Fig. 19), it first adds a T-event e and its edges to if e is a not-happened-before node in both and . Then, it removes e from and . This process continues until there does not exist any T-event which is a not-happened-before node in both and . 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.
• 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: email@example.com.
• 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: firstname.lastname@example.org.
• 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: email@example.com.
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: firstname.lastname@example.org, and reference IEEECS Log Number 117488err.