The Combinatorics of Non-determinism

From MaRDI portal

Revision as of 20:18, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2963932

Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2013.425zbMath1359.68080OpenAlexW2248999168MaRDI QIDQ2963932

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

Publication date: 21 February 2017

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

zbMATH Keywords

analytic combinatorics concurrency theory uniform random generation nondeterministic choice partially 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)

Related Items (7)

A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ Extended boxed product and application to synchronized trees ⋮ The Combinatorics of Barrier Synchronization ⋮ A quantitative study of pure parallel processes ⋮ Beyond series-parallel concurrent systems: the case of arch processes ⋮ Unnamed Item ⋮ Unnamed Item

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2963932&oldid=15970213"