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₀ ∧ X₀ ≤ X₁
t₁: l1(X₀, X₁) → l1(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₀-1, X₁) :|: 1 ≤ X₀ ∧ X₀ ≤ X₁
t₁: l1(X₀, X₁) → l1(X₁, X₁) :|: 1 ≤ X₀ ∧ X₁+1 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₁: l1(X₀, X₁) → l1(X₁, X₁) :|: 1 ≤ X₀ ∧ X₁+1 ≤ X₀
new bound:
X₀ {O(n)}
Overall timebound:X₀+2 {O(n)}
t₀: X₀ {O(n)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
Overall costbound: X₀+2 {O(n)}
t₀: X₀ {O(n)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₀, X₀: X₀+X₁ {O(n)}
t₀, X₁: 2⋅X₁ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}