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