Deterministic concurrent systems

DOI10.1007/978-3-030-76983-3_21zbMATH Open1489.68148arXiv2008.07233OpenAlexW3175807632MaRDI QIDQ2117189FDOQ2117189

Authors: Samy Abbes 

Publication date: 21 March 2022

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.

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

zbMATH Keywords

latticeconcurrency[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=M%EF%BF%BD%EF%BF%BDbius+transform&go=Go M��bius transform]trace monoid

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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)