Initial Problem

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

Preprocessing

Problem after Preprocessing

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

MPRF for transition t₀: f(X₀, X₁, X₂) → f(X₀, 1+X₁, X₂) :|: 1+X₁+X₂ ≤ X₀ of depth 1:

new bound:

X₀+X₁+X₂ {O(n)}

• f: [X₀-X₁-X₂]

MPRF for transition t₁: f(X₀, X₁, X₂) → f(X₀, X₁, 1+X₂) :|: 1+X₁+X₂ ≤ X₀ of depth 1:

new bound:

X₀+X₁+X₂ {O(n)}

• f: [X₀-X₁-X₂]

All Bounds

Timebounds

Overall timebound:2⋅X₀+2⋅X₁+2⋅X₂+1 {O(n)}
t₀: X₀+X₁+X₂ {O(n)}
t₁: X₀+X₁+X₂ {O(n)}
t₂: 1 {O(1)}

Costbounds

Overall costbound: 2⋅X₀+2⋅X₁+2⋅X₂+1 {O(n)}
t₀: X₀+X₁+X₂ {O(n)}
t₁: X₀+X₁+X₂ {O(n)}
t₂: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₀, X₁: 2⋅X₁+X₀+X₂ {O(n)}
t₀, X₂: 2⋅X₂+X₀+X₁ {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: 2⋅X₁+X₀+X₂ {O(n)}
t₁, X₂: 2⋅X₂+X₀+X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₂, X₂: X₂ {O(n)}