scientific article; zbMATH DE number 7204953

DOI10.4230/LIPIcs.CONCUR.2017.36zbMath1442.68081MaRDI QIDQ5111650

Nicolas Basset, Michèle Soria, Jean Mairesse

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recursive methoduniform samplingBoltzmann samplingParry measurepartially synchronised automata

Mathematics Subject Classification ID

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

Related Items (5)

A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ The Combinatorics of Barrier Synchronization ⋮ A combinatorial study of async/await processes ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new dichotomic algorithm for the uniform random generation of words in regular languages
• A calculus for the random generation of labelled combinatorial structures
• A linear algorithm for the random sampling from regular languages
• The Shuffle Product: New Research Directions
• Uniform Generation in Trace Monoids
• The Combinatorics of Non-determinism
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Automata on Distributed Alphabets
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: