Deterministic concurrent systems

DOI10.1007/978-3-030-76983-3_21MaRDI QIDQ2117189zbMATH OpenOpenAlexFDO

Authors Samy Abbes

Publication date 21 March 2022

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

zbMATH Keywords

concurrencylatticeMöbius transformtrace monoid

Mathematics Subject Classification ID

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

Abstract: We introduce deterministic concurrent systems as a subclass of concurrent systems. Deterministic concurrent system are "locally commutative" concurrent systems. We prove that irreducible and deterministic concurrent systems have a unique probabilistic dynamics, and we characterise these systems by means of their analytic combinatorics properties.

Cites work

• Clique polynomials have a unique root of smallest modulus
• Combinatorial problems of commutation and rearrangements
• Combinatorics on traces
• Computing the average parallelism in trace monoids.
• Foundations of Garside theory
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• Markovian dynamics of concurrent systems
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Petri nets, event structures and domains. I
• Uniform and Bernoulli measures on the boundary of trace monoids

Cited in

(1)

• scientific article; zbMATH DE number 23767 (Why is no real title available?)

This page was built for publication: Deterministic concurrent systems

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