Deterministic concurrent systems

DOI10.1007/978-3-030-76983-3_21zbMath1489.68148arXiv2008.07233OpenAlexW3175807632MaRDI QIDQ2117189

Samy Abbes

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2008.07233

zbMATH Keywords

latticeconcurrencyMöbius transformtrace monoid

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Clique polynomials have a unique root of smallest modulus
• Uniform and Bernoulli measures on the boundary of trace monoids
• Petri nets, event structures and domains. I
• Combinatorics on traces
• Computing the average parallelism in trace monoids.
• Markovian dynamics of concurrent systems
• Foundations of Garside theory
• Combinatorial problems of commutation and rearrangements
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: Deterministic concurrent systems