Quantitative and Algorithmic aspects of Barrier Synchronization in Concurrency

In this paper we address the problem of understanding Concurrency Theory from a combinatorial point of view. We are interested in quantitative results and algorithmic tools to refine our understanding of the classical combinatorial explosion phenomenon arising in concurrency. This paper is essential...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 22 no. 3, Computational...; no. Special issues
Main Authors:	Bodini, OLivier, Dien, Matthieu, Genitrini, Antoine, Peschanski, Frédéric
Format:	Journal Article
Language:	English
Published:	DMTCS 25.01.2021 Discrete Mathematics & Theoretical Computer Science
Series:	Computational Logic and Applications (CLA'19)
Subjects:	[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] [info.info-ds]computer science [cs]/data structures and algorithms [cs.ds] barrier synchronization combinatorics Computer Science Data Structures and Algorithms Discrete Mathematics fork-join processes partial order theory promises uniform random generation Barrier synchronization Fork-Join processes Combinatorics Uniform random generation Partial Order Theory Promises
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!