The concurrency hierarchy, and algorithms for unbounded concurrency

DOI10.1145/383962.384008zbMath1333.68104MaRDI QIDQ2787678

Michael Merritt, Gadi Taubenfeld, Eli Gafni

Publication date: 4 March 2016

Published in: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/383962.384008

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

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

68W15: Distributed algorithms

Related Items

On the cost of uniform protocols whose memory consumption is adaptive to interval contention