Initial Problem

Start: start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f0, start
Transitions:
t₀: f0(X₀, X₁) → f0(X₀, X₀) :|: 1+X₀ ≤ 0 ∧ 0 ≤ X₁ ∧ X₁ ≤ 0
t₁: f0(X₀, X₁) → f0(X₀, X₀) :|: 1 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ 0
t₂: start(X₀, X₁) → f0(X₀, X₁)

Preprocessing

Problem after Preprocessing

Start: start
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f0, start
Transitions:
t₀: f0(X₀, X₁) → f0(X₀, X₀) :|: 1+X₀ ≤ 0 ∧ 0 ≤ X₁ ∧ X₁ ≤ 0
t₁: f0(X₀, X₁) → f0(X₀, X₀) :|: 1 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ 0
t₂: start(X₀, X₁) → f0(X₀, X₁)

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₀: f0(X₀, X₁) → f0(X₀, X₀) :|: 1+X₀ ≤ 0 ∧ 0 ≤ X₁ ∧ X₁ ≤ 0

knowledge_propagation leads to new time bound 1 {O(1)} for transition t₁: f0(X₀, X₁) → f0(X₀, X₀) :|: 1 ≤ X₀ ∧ 0 ≤ X₁ ∧ X₁ ≤ 0

All Bounds

Timebounds

Overall timebound:3 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}

Costbounds

Overall costbound: 3 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}

Sizebounds

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)}