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₀-1, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
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₀-1, X₁) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 1 ≤ X₀ ∧ 1 ≤ X₁
new bound:
X₀ {O(n)}
MPRF:
l1 [X₀ ]
new bound:
X₁ {O(n)}
MPRF:
l1 [X₁ ]
Overall timebound:X₀+X₁+1 {O(n)}
t₂: 1 {O(1)}
t₀: X₀ {O(n)}
t₁: X₁ {O(n)}
Overall costbound: X₀+X₁+1 {O(n)}
t₂: 1 {O(1)}
t₀: X₀ {O(n)}
t₁: X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₀, X₀: 2⋅X₀ {O(n)}
t₀, X₁: 2⋅X₁ {O(n)}
t₁, X₀: 2⋅X₀ {O(n)}
t₁, X₁: 2⋅X₁ {O(n)}