A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space

DOI10.1016/j.tcs.2022.01.014zbMath1483.68230OpenAlexW3169635981MaRDI QIDQ2120961

Frédéric Peschanski, Martin Pépin, Antoine Genitrini

Publication date: 1 April 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.sorbonne-universite.fr/hal-03201618/file/preprint.pdf

zbMATH Keywords

combinatoricsloopsconcurrencynondeterminismuniform random generationfork-join processes

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Randomized algorithms (68W20)

Uses Software

• FLINT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• A quantitative study of pure parallel processes
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• A method and two algorithms on the theory of partitions
• A calculus for the random generation of labelled combinatorial structures
• Statistical analysis of non-deterministic fork-join processes
• Entropic uniform sampling of linear extensions in series-parallel posets
• Modern Computer Algebra
• Uniform Generation in Trace Monoids
• The Combinatorics of Non-determinism
• Random Trees
• The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes
• Polynomial tuning of multiparametric combinatorial samplers
• Tools and Algorithms for the Construction and Analysis of Systems