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