scientific article; zbMATH DE number 7204953

DOI10.4230/LIPICS.CONCUR.2017.36zbMATH Open1442.68081MaRDI QIDQ5111650FDOQ5111650

Authors: Nicolas Basset, Jean Mairesse, Michèle Soria 

Publication date: 27 May 2020

Title of this publication is not available (Why is that?)

Recommendations

• Sampling automata and programs
• Uniform sampling for timed automata with application to language inclusion measurement
• scientific article; zbMATH DE number 1827972
• Publication:4945339
• scientific article; zbMATH DE number 956807
• On synchronizing automata and uniform distribution
• Deterministic Sampling Algorithms for Network Design
• Deterministic sampling algorithms for network design

zbMATH Keywords

recursive methoduniform samplingBoltzmann samplingParry measurepartially synchronised automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Analytic combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Noncommutative rational series with applications
• Title not available (Why is that?)
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• A calculus for the random generation of labelled combinatorial structures
• Biased Boltzmann samplers and generation of extended linear languages with shuffle
• A new dichotomic algorithm for the uniform random generation of words in regular languages
• Title not available (Why is that?)
• Uniform generation in trace monoids
• Title not available (Why is that?)
• Tools and Algorithms for the Construction and Analysis of Systems
• A linear algorithm for the random sampling from regular languages
• The Shuffle Product: New Research Directions
• The Combinatorics of Non-determinism
• Automata on distributed alphabets

Cited In (6)

• Title not available (Why is that?)
• The Combinatorics of Barrier Synchronization
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• A combinatorial study of async/await processes
• Title not available (Why is that?)
• Sampling different kinds of acyclic automata using Markov chains

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111650)