Enumeration and random generation of concurrent computations

MaRDI QIDQ2920847zbMATH OpenFDO

Authors Olivier Bodini, Antoine Genitrini, Frédéric Peschanski

Publication date 29 September 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAQ0108/0.html

zbMATH Keywords

concurrency theory

Mathematics Subject Classification ID

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)

Recommendations

• A quantitative study of pure parallel processes
• The Combinatorics of Non-determinism
• Associativity for binary parallel processes: a quantitative study
• Beyond series-parallel concurrent systems: the case of arch processes
• Concurrent Probabilistic Programs, Or: How to Schedule If You Must

Cited in

(7)

• Randomized Concurrent Set Union and Generalized Wake-Up
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• Sequential and parallel enumeration
• Beyond series-parallel concurrent systems: the case of arch processes
• A quantitative study of pure parallel processes
• Associativity for binary parallel processes: a quantitative study
• Uniform generation in trace monoids

This page was built for publication: Enumeration and random generation of concurrent computations

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