About the Termination Detection in the Asynchronous Message Passing Model
DOI10.1007/978-3-540-69507-3_16zbMATH Open1130.68078OpenAlexW2101097602MaRDI QIDQ5448773FDOQ5448773
Authors: J. Chalopin, Emmanuel Godard, Gerard Tel, Yves Métivier
Publication date: 7 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_16
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- Synchronized Distributed Termination
- Title not available (Why is that?)
- On mobile agent verifiable problems
- Title not available (Why is that?)
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
- Deducible and equivalent structural knowledges in distributed algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local Terminations and Distributed Computability in Anonymous Networks
- Ring based termination detection algorithm for distributed computations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: About the Termination Detection in the Asynchronous Message Passing Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448773)