Abstract:
In this paper we present a novel abstraction technique for Markov decision processes (MDPs), which are widely used for modelling systems that exhibit both probabilistic and nondeterministic behaviour. In the field of model checking, abstraction has proved an extremely successful tool to combat the state-space explosion problem. In the probabilistic setting, however, little practical progress has been made in this area. We propose an abstraction method for MDPs based on stochastic two-player games. The key idea behind this approach is to maintain a separation between nondeterminism present in the original MDP and nondeterminism introduced through abstraction, each type being represented by a different player in the game. Crucially, this allows us to obtain distinct lower and upper bounds for both the best and worst-case performance (minimum or maximum probabilities) of the MDP. We have implemented our techniques and illustrate their practical utility by applying them to a quantitative analysis of the Zeroconf dynamic network configuration protocol. 1
Citations
|
1620
|
Model Checking
– Clarke, Grumberg, et al.
- 1999
|
|
1428
|
Probability and Measure
– Billingsley
- 1995
|
|
484
|
Finite Markov Chains
– Kemeny, Snell
- 1960
|
|
331
|
Counterexample-guided abstraction refinement for symbolic model checking
– Clarke, Grumberg, et al.
|
|
151
|
Modeling and verification of randomized distributed real-time systems
– Segala
- 1995
|
|
142
|
A logic for reasoning about time and reliability
– Hansson, Jonsson
- 1994
|
|
103
|
Bisimulation for labelled Markov processes
– Blute, Desharnais, et al.
|
|
97
|
Probabilistic symbolic model checking with prism: a hybrid approach
– Kwiatkowska, Norman, et al.
- 2004
|
|
96
|
Model checking for a probabilistic branching time logic with fairness
– Baier, Kwiatkowska
- 1998
|
|
96
|
The complexity of stochastic games
– Condon
- 1992
|
|
71
|
Formal Verification of Probabilistic Systems
– Alfaro
- 1997
|
|
44
|
Tsitsiklis. An analysis of stochastic shortest path problems
– Bertsekas, N
- 1991
|
|
41
|
D.: PRISM: A tool for automatic verification of probabilistic systems
– Hinton, Kwiatkowska, et al.
- 2006
|
|
34
|
Dynamic Configuration of IPv4 link-local addresses, draft-ietfzeroconf-ipv4-linklocal-00.txt. http://www.ietf.org/internet-drafts/draft-ietf-zeroconfipv4-linklocal-00.txt, 8th October 2000. A work in progress
– Cheshire
|
|
33
|
On algorithms for simple stochastic games
– Condon
- 1993
|
|
32
|
Abstraction, Refinement and Proof of Probabilistic Systems
– McIver, Morgan
- 2004
|
|
31
|
K.G.: Reachability analysis of probabilistic systems by successive refinements
– D’Argenio, Jeannet, et al.
- 2001
|
|
29
|
Concurrent reachability games
– Alfaro, Henzinger, et al.
- 2007
|
|
28
|
Computing minimum and maximum reachability times in probabilistic systems
– Alfaro
- 1999
|
|
23
|
Performance Analysis of Probabilistic Timed Automata using Digital Clocks
– Kwiatkowska, Norman, et al.
- 2006
|
|
17
|
A game-based framework for CTL counterexamples and 3-valued abstraction-refinemnet. in
– Shoham, Grumberg
|
|
10
|
Abstract interpretation of programs as markov decision processes
– Monniaux
- 2003
|
|
9
|
Trading memory for randomness
– Chatterjee, Alfaro, et al.
- 2004
|
|
7
|
Partial order reduction on concurrent probabilistic programs
– D’Argenio, Niebert
- 2004
|
|
7
|
V.: Don’t know in probabilistic systems
– Fecher, Leucker, et al.
- 2006
|
|
7
|
On finite-state approximations for probabilistic computational-tree logic
– Huth
- 2005
|
|
6
|
Partial order reduction for probabilistic systems
– Baier, Größer, et al.
- 2004
|
|
5
|
An abstraction framework for mixed non-deterministic and probabilistic systems
– Huth
- 2004
|
|
3
|
Analysing randomized distributed algorithms
– Norman
- 2004
|
|
1
|
Probabilistic guarded commands mechanized
– Hurd, McIver, et al.
|
