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