Uniform sampling for networks of automata

Abstract : We call network of automata a family of partially synchronised automata, i.e. a family of deterministic automata which are synchronised via shared letters, and evolve independently otherwise. We address the problem of uniform random sampling of words recognised by a network of automata. To that purpose, we define the reduced automaton of the model, which involves only the product of the synchronised part of the component automata. We provide uniform sampling algorithms which are polynomial with respect to the size of the reduced automaton, greatly improving on the best known algorithms. Our sampling algorithms rely on combinatorial and probabilistic methods and are of three different types: exact, Boltzmann and Parry sampling.
Document type :
Conference papers
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01545936
Contributor : Michèle Soria <>
Submitted on : Friday, June 23, 2017 - 11:58:45 AM
Last modification on : Thursday, March 21, 2019 - 1:00:41 PM

Identifiers

  • HAL Id : hal-01545936, version 1

Citation

Nicolas Basset, Jean Mairesse, Michèle Soria. Uniform sampling for networks of automata. CONCUR 2017 28th International Conference on Concurrency Theory, Sep 2017, Berlin, Germany. ⟨hal-01545936⟩

Share

Metrics

Record views

144