Ho, Hong-FaHong-FaHo陳健輝郭德盛Chen, Gen-HueyGen-HueyChenKuo, Te-SonTe-SonKuo2009-02-032018-07-052009-02-032018-07-051990-06https://www.scopus.com/inward/record.uri?eid=2-s2.0-0025418683&partnerID=40&md5=e23f787a93c001842a2b7f01f86d4a77Most methods for testing sequential programs are useless in testing concurrent programs, owing to the existence of multiple execution flows in concurrent programs. In the paper, a systematic branch testing method for concurrent programs is proposed. Paths generated by the proposed method can be sensitized to obtain the necessary test data. In particular, the proposed method possesses generality, and is capable of detecting all dead codes and deadlocks due to incorrect program design. For evaluating different tests, two new coverage measures used for estimating the quality of testing concurrent programs are proposed. It is shown here that to find optimal paths for branch testing of concurrent programs is NP-hard. The path selection problem with budget limitation is also discussed. Experimental results provide support for the proposed method.en-USMathematical Techniques - Petri Nets; Concurrent Programs; Petri Net Models; Computer Softwarejournal article2-s2.0-0025418683