Space Efficient Reachability Analysis Through Use of Pseudo-Root States.
Atanas N. ParashkevovJay YantchevPublished in: TACAS (1997)
Keyphrases
- space efficient
- reachability analysis
- model checking
- markov decision processes
- data structure
- data streams
- sliding window
- timed automata
- state space
- incremental algorithms
- range sum queries
- b tree
- markov decision problems
- suffix array
- tree structure
- linear space
- initial state
- bloom filter
- real time
- kd tree
- belief state
- temporal constraints
- dynamic programming
- uncertain data streams