Branch testing of concurrent programs using Petri net models

Hong Fa Ho, Gen Heuy Chen, Te Son Kuo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)116-125
Number of pages10
JournalComputer Systems Science and Engineering
Volume5
Issue number2
Publication statusPublished - 1990 Apr 1

Fingerprint

Petri nets
Petri Nets
Concurrent
Branch
Testing
Model
Sequential Testing
Path
Optimal Path
Deadlock
Coverage
NP-complete problem
Necessary
Experimental Results

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Branch testing of concurrent programs using Petri net models. / Ho, Hong Fa; Chen, Gen Heuy; Kuo, Te Son.

In: Computer Systems Science and Engineering, Vol. 5, No. 2, 01.04.1990, p. 116-125.

Research output: Contribution to journalArticle

Ho, Hong Fa ; Chen, Gen Heuy ; Kuo, Te Son. / Branch testing of concurrent programs using Petri net models. In: Computer Systems Science and Engineering. 1990 ; Vol. 5, No. 2. pp. 116-125.
@article{c97eff76fb0e499fa679756ae1fa38e5,
title = "Branch testing of concurrent programs using Petri net models",
abstract = "Most 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.",
author = "Ho, {Hong Fa} and Chen, {Gen Heuy} and Kuo, {Te Son}",
year = "1990",
month = "4",
day = "1",
language = "English",
volume = "5",
pages = "116--125",
journal = "Computer Systems Science and Engineering",
issn = "0267-6192",
publisher = "CRL Publishing",
number = "2",

}

TY - JOUR

T1 - Branch testing of concurrent programs using Petri net models

AU - Ho, Hong Fa

AU - Chen, Gen Heuy

AU - Kuo, Te Son

PY - 1990/4/1

Y1 - 1990/4/1

N2 - Most 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.

AB - Most 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.

UR - http://www.scopus.com/inward/record.url?scp=0025418683&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025418683&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0025418683

VL - 5

SP - 116

EP - 125

JO - Computer Systems Science and Engineering

JF - Computer Systems Science and Engineering

SN - 0267-6192

IS - 2

ER -