Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1
Transitions:
t₁: l0(X₀) → l1(X₀)
t₀: l1(X₀) → l1(2⋅B-2) :|: 0 ≤ 2⋅B ∧ X₀ ≤ 1+2⋅B ∧ 1+2⋅B ≤ X₀
Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1
Transitions:
t₁: l0(X₀) → l1(X₀)
t₀: l1(X₀) → l1(2⋅B-2) :|: 0 ≤ 2⋅B ∧ X₀ ≤ 1+2⋅B ∧ 1+2⋅B ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₀: l1(X₀) → l1(2⋅B-2) :|: 0 ≤ 2⋅B ∧ X₀ ≤ 1+2⋅B ∧ 1+2⋅B ≤ X₀
Overall timebound:2 {O(1)}
t₁: 1 {O(1)}
t₀: 1 {O(1)}
Overall costbound: 2 {O(1)}
t₁: 1 {O(1)}
t₀: 1 {O(1)}
t₁, X₀: X₀ {O(n)}
t₀, X₀: X₀+1 {O(n)}