Sciweavers

ENTCS
2008
103views more  ENTCS 2008»
13 years 5 months ago
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
Stefan Blom, Boudewijn R. Haverkort, Matthias Kunt...
ENTCS
2008
132views more  ENTCS 2008»
13 years 5 months ago
Distributed Verification of Multi-threaded C++ Programs
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
Stefan Edelkamp, Shahid Jabbar, Damian Sulewski
ENTCS
2008
90views more  ENTCS 2008»
13 years 5 months ago
A Database Approach to Distributed State Space Generation
We study distributed state space generation on a cluster of workstations. It is explained why state space partitioning by a global hash function is problematic when states contain...
Stefan Blom, Bert Lisser, Jaco van de Pol, Michael...
CSDA
2008
62views more  CSDA 2008»
13 years 5 months ago
Waiting time distribution of generalized later patterns
In this paper the concept of later waiting time distributions for patterns in multi-state trials is generalized to cover a collection of compound patterns that must all be counted...
Donald E. K. Martin, John A. D. Aston
ATAL
2010
Springer
13 years 6 months ago
Learning multi-agent state space representations
This paper describes an algorithm, called CQ-learning, which learns to adapt the state representation for multi-agent systems in order to coordinate with other agents. We propose ...
Yann-Michaël De Hauwere, Peter Vrancx, Ann No...
PSTV
1992
113views Hardware» more  PSTV 1992»
13 years 6 months ago
Coverage Preserving Reduction Strategies for Reachability Analysis
We study the effect of three new reduction strategies for conventional reachability analysis, as used in automated protocol validation algorithms. The first two strategies are imp...
Gerard J. Holzmann, Patrice Godefroid, Didier Piro...
AAAI
1996
13 years 6 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
UAI
1998
13 years 6 months ago
Hierarchical Solution of Markov Decision Processes using Macro-actions
tigate the use of temporally abstract actions, or macro-actions, in the solution of Markov decision processes. Unlike current models that combine both primitive actions and macro-...
Milos Hauskrecht, Nicolas Meuleau, Leslie Pack Kae...
AAAI
1997
13 years 6 months ago
Model Minimization in Markov Decision Processes
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
Thomas Dean, Robert Givan
AAAI
2000
13 years 6 months ago
Predicting Future User Actions by Observing Unmodified Applications
Intelligent user interfaces often rely on modified applications and detailed application models. Such modifications and models are expensive to build and maintain. We propose to a...
Peter Gorniak, David Poole