Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C, D
Locations: l0, l1
Transitions:
t₁: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-C, X₁+D) :|: X₁+1 ≤ X₀ ∧ 0 ≤ C ∧ 1 ≤ D
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C, D
Locations: l0, l1
Transitions:
t₁: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-C, X₁+D) :|: X₁+1 ≤ X₀ ∧ 0 ≤ C ∧ 1 ≤ D
new bound:
X₀+X₁ {O(n)}
MPRF:
l1 [X₀-X₁ ]
Overall timebound:X₀+X₁+1 {O(n)}
t₁: 1 {O(1)}
t₀: X₀+X₁ {O(n)}
Overall costbound: X₀+X₁+1 {O(n)}
t₁: 1 {O(1)}
t₀: X₀+X₁ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}