A quantitative study of pure parallel processes
From MaRDI portal
Publication:907263
zbMath1329.05066arXiv1407.1873MaRDI QIDQ907263
Olivier Bodini, Frédéric Peschanski, Antoine Genitrini
Publication date: 25 January 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1873
interleaving semanticsholonomic functionsrandom generationincreasing treesanalytic combinatoricsconcurrency theorypure merge
Trees (05C05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Combinatorics of partially ordered sets (06A07) Asymptotic enumeration (05A16)
Related Items (7)
A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ Entropic uniform sampling of linear extensions in series-parallel posets ⋮ Extended boxed product and application to synchronized trees ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ The Combinatorics of Barrier Synchronization ⋮ Beyond series-parallel concurrent systems: the case of arch processes ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear extension sums as valuations on cones
- Noncommutative symmetric functions. VII: Free quasi-symmetric functions revisited
- Twelve countings with rooted plane trees
- On the number of trees in a random forest
- Multiset theory
- Differentiably finite power series
- A holonomic systems approach to special functions identities
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Hopf algebras, renormalization and noncommutative geometry
- On computing the number of linear extensions of a tree
- Dyck tilings, increasing trees, descents, and inversions
- Fast perfect sampling from linear extensions
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- The Combinatorics of Non-determinism
- Random Trees
- The Saga of the Axiomatization of Parallel Composition
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- An Efficient Method for Weighted Sampling without Replacement
- Process Algebra
- On the Altitude of Nodes in Random Trees
- GFUN
- Analytic aspects of the shuffle product
- Associativity for Binary Parallel Processes: A Quantitative Study
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: A quantitative study of pure parallel processes
