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