Preprocessing

Probabilistic Analysis

Probabilistic Program after Preprocessing

Start: f
Program_Vars: X₀
Temp_Vars:
Locations: f, g
Transitions:
g₀:f(X₀) -{0}> t₁:g(X₀) :|:
g₂:g(X₀) → [1/2]:t₃:g(X₀-1) :+: [1/2]:t₄:g(X₀-2) :|: 2 ≤ X₀

Run classical analysis on SCC: [f]

Classical Approximation after Lifting Classical Results

All Bounds
Timebounds

Overall timebound:inf {Infinity}
g₀: 1 {O(1)}
g₂: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
g₀: inf {Infinity}
g₂: inf {Infinity}

Sizebounds

(g₀,g), X₀: X₀ {O(n)}

Run probabilistic analysis on SCC: [f]

Run classical analysis on SCC: [g]

MPRF for transition t₃: g(X₀) → g(X₀-1) :|: 2 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF:

• g: [X₀]

MPRF for transition t₄: g(X₀) → g(X₀-2) :|: 2 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

MPRF:

• g: [X₀]

Classical Approximation after Lifting Classical Results

All Bounds
Timebounds

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

Costbounds

Overall costbound: inf {Infinity}
g₀: inf {Infinity}
g₂: inf {Infinity}

Sizebounds

(g₀,g), X₀: X₀ {O(n)}
(g₂,g), X₀: 2⋅X₀ {O(n)}

Run probabilistic analysis on SCC: [g]

Results of Probabilistic Analysis

All Bounds

Timebounds

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

Costbounds

Overall costbound: 4⋅X₀ {O(n)}
g₀: 0 {O(1)}
g₂: 4⋅X₀ {O(n)}

Sizebounds

(g₀,g), X₀: X₀ {O(n)}
(g₂,g), X₀: X₀ {O(n)}