Uniform Random Sampling of Traces in Very Large Models

Simple item page
dc.creatorDenise, Alain
dc.creatorGaudel, Marie-Claude
dc.creatorGouraud, Sandrine-Dominique
dc.creatorLasseigne, Richard
dc.creatorPeyronnet, Sylvain
dc.creatorCollaboration, the RaST
dc.date2006-06-20
dc.date.accessioned2026-07-07T07:13:06Z
dc.date.available2026-07-07T07:13:06Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/cs/0606086
dc.identifierhttp://arxiv.org/abs/cs/0606086
dc.identifierFirst International Workshop on Random Testing, États-Unis d'Amérique (2006) 10-19
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112320
dc.subjectLogic in Computer Science
dc.subjectD.2.4; D.2.5
dc.titleUniform Random Sampling of Traces in Very Large Models
dc.typetext

Files

Collections

arXiv