Uniform Generation in Trace Monoids
From MaRDI portal
Publication:2946325
DOI10.1007/978-3-662-48057-1_5zbMath1465.05182arXiv1506.02455OpenAlexW2112148541MaRDI QIDQ2946325
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02455
Free semigroups, generators and relations, word problems (20M05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space ⋮ Markovian dynamics of concurrent systems ⋮ Toward uniform random generation in 1-safe Petri nets ⋮ The Combinatorics of Barrier Synchronization ⋮ A combinatorial study of async/await processes ⋮ Uniform measures on braid monoids and dual braid monoids ⋮ Unnamed Item ⋮ Synchronization of Bernoulli sequences on shared letters ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Uniform and Bernoulli measures on the boundary of trace monoids
- Projective topology on bifinite domains and applications
- A fluid analysis framework for a Markovian process algebra
- Combinatorics on traces
- Uniform random generation of decomposable structures using floating-point arithmetic
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
- Combinatorial problems of commutation and rearrangements
- A Course in Enumeration
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- An Introduction to Symbolic Dynamics and Coding
- Note on the Smallest Root of the Independence Polynomial
- Intrinsic Markov Chains
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
