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