The Combinatorics of Non-determinism

DOI10.4230/LIPICS.FSTTCS.2013.425zbMATH Open1359.68080OpenAlexW2248999168MaRDI QIDQ2963932FDOQ2963932

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

Publication date: 21 February 2017

Full work available at URL: https://hal.science/hal-01216553

Recommendations

• The determinism of randomness and its use in combinatorics
• Kolmogorov complexity and non-determinism
• Combinatorics, complexity, and randomness
• Multiplicities: A deterministic view of nondeterminism
• scientific article; zbMATH DE number 1324656
• scientific article; zbMATH DE number 3894449
• scientific article; zbMATH DE number 4149545
• Interactions of computability and randomness

zbMATH Keywords

analytic combinatoricsconcurrency theoryuniform random generationnondeterministic choicepartially increasing trees

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (12)

• Title not available (Why is that?)
• Beyond series-parallel concurrent systems: the case of arch processes
• Enumeration and random generation of concurrent computations
• The Combinatorics of Barrier Synchronization
• Increasing diamonds
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• Title not available (Why is that?)
• Title not available (Why is that?)
• A quantitative study of pure parallel processes
• Probabilistic Choice, Reversibility, Loops, and Miracles
• Extended boxed product and application to synchronized trees
• Associativity for binary parallel processes: a quantitative study

This page was built for publication: The Combinatorics of Non-determinism

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