Damian Sulewski

Learn More
In this paper we consider the search in large state spaces with high branching factors and an objective function to be maximized. Our method portfolio , which we refer to as heuristically guided swarm tree search, is randomized, as it consists of several Monte-Carlo runs, and guided, as it relies on fitness selection. We apply different search enhancement(More)
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). For this purpose we exploit the fact that some of the basic algorithms for prob-abilistic model checking rely on matrix vector multiplication. Since this kind of linear algebraic operations are implemented very efficiently on GPGPUs, the new(More)
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the traditional sequential algorithms. In particular, we capitalize on the fact that in most of them operations like matrix–vector multiplication and solving systems of linear equations are(More)
We accelerate state space exploration for explicit-state model checking by executing complex operations on the graphics processing unit (GPU). In contrast to existing approaches enhancing model checking through performing parallel matrix operations on the GPU, we paral-lelize the breadth-first layered construction of the state space graph. For efficient(More)
This paper exploits parallel computing power of graphics cards to accelerate state space search. We illustrate that modern graphics processing units (GPUs) have the potential to speed up breadth-first search significantly. For a bitvector representation of the search frontier, GPU algorithms with one and two bits per state are presented. Efficient perfect(More)
In this paper we improve solving two-player games by computing the game-theoretical value of every reachable state. A graphics processing unit located on the graphics card is used as a co-processor to accelerate the solution process. We exploit perfect hash functions to store the game states efficiently in memory and to transfer their ordinal representation(More)
As flash media become common and their capacities and speed grow, they are becoming a practical alternative for standard mechanical drives. So far, external memory model checking algorithms have been optimized for mechanical hard disks corresponding to the model of Aggarwal and Vitter [1]. Since flash memories are essentially different, the model of(More)
Solid state disks based on flash memory are an apparent alternative to hard disks for external-memory search. Random reads are much faster, while random writes are generally not. In this paper we illustrate, how this influences the time-space trade-offs for scaling semi-external LTL model checking algorithms that request a constant number of bits per state(More)