Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1
Transitions:
t₀: l0(X₀, X₁) → l1(X₀, X₁)
t₁: l1(X₀, X₁) → l1(C+1, C+1)
Eliminate variables {C,X₀,X₁} that do not contribute to the problem
Start: l0
Program_Vars:
Temp_Vars:
Locations: l0, l1
Transitions:
t₅: l0 → l1
t₆: l1 → l1
Overall timebound:inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}
Overall costbound: inf {Infinity}
t₅: 1 {O(1)}
t₆: inf {Infinity}