Computing in the presence of concurrent solo executions

DOI10.1007/978-3-642-54423-1_19zbMATH Open1405.68213OpenAlexW1577529853MaRDI QIDQ5405041FDOQ5405041

Authors: Sergio Rajsbaum, Michel Raynal, Julien Stainer, Maurice Herlihy 

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_19

Recommendations

• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Wait-free solvability of colorless tasks in anonymous shared-memory model
• The topological structure of asynchronous computability

Mathematics Subject Classification ID

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

Cited In (3)

• Wait-free solvability of colorless tasks in anonymous shared-memory model
• Title not available (Why is that?)
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing

This page was built for publication: Computing in the presence of concurrent solo executions

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