Uniform Random Sampling of Traces in Very Large Models
Logic in Computer Science
2007-05-23 v1
Abstract
This paper presents some first results on how to perform uniform random walks (where every trace has the same probability to occur) in very large models. The models considered here are described in a succinct way as a set of communicating reactive modules. The method relies upon techniques for counting and drawing uniformly at random words in regular languages. Each module is considered as an automaton defining such a language. It is shown how it is possible to combine local uniform drawings of traces, and to obtain some global uniform random sampling, without construction of the global model.
Cite
@article{arxiv.cs/0606086,
title = {Uniform Random Sampling of Traces in Very Large Models},
author = {Alain Denise and Marie-Claude Gaudel and Sandrine-Dominique Gouraud and Richard Lasseigne and Sylvain Peyronnet and the RaST Collaboration},
journal= {arXiv preprint arXiv:cs/0606086},
year = {2007}
}