Path-Wise Test Data Generation Based on Heuristic Look-Ahead Methods

Table 3

PTC process for 𝑥1, 𝑥2, and 𝑥3.

Branching condition	Basic functions and corresponding monotonicity	Monotonicity of branching conditions	Weight	Path weight	Path tendency
𝑥1−𝑥2>0	𝑓(𝑥1)=𝑥1−𝑥2: increasing; 𝑓(𝑥2)=𝑥1−𝑥2: decreasing; 𝑓(𝑏1)=𝑏1>0: increasing	Br(𝑥1): increasing; Br(𝑥2): decreasing	𝑤1=0.5; 𝑤2=−0.5	𝑝𝑤1=0.5; 𝑝𝑤2=−1; 𝑝𝑤3=1.5	{⟨𝑥1,positive⟩,; ⟨𝑥2,negative⟩,; ⟨𝑥3,positive⟩}
𝑥3−𝑥2>0	𝑓(𝑥2)=𝑥3−𝑥2: decreasing; 𝑓(𝑥3)=𝑥3−𝑥2: increasing; 𝑓(𝑏2)=𝑏2>0: increasing	Br(𝑥2): decreasing; Br(𝑥3): increasing	𝑤2=−0.5; 𝑤3=0.5
3∗𝑥3≥−5	𝑓(𝑥3)=3∗𝑥3: increasing; 𝑓(𝑏3)=𝑏3≥−5: increasing	Br(𝑥3): increasing	𝑤3=1