scientific article; zbMATH DE number 2016070

MaRDI QIDQ4438773zbMATH OpenFDO

Authors Emmanuel Godard, Mohamed Mosbah, Afif Sellami, Yves Métivier

Publication date 10 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2505/25050106.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A fully distributed termination detection scheme
• Distributed termination detection for dynamic systems
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
• Distributed algorithms for static and dynamic termination detection
• Publication:4725762

Cited in

(13)

• The derivation of graph marking algorithms from distributed termination detection protocols
• A fully distributed termination detection scheme
• Distributed graph traversals by relabelling systems with applications
• Hard combinators
• Characterizing topological assumptions of distributed algorithms in dynamic networks
• Graph Multiset Transformation as a Framework for Massively Parallel Computation
• Certifying a Termination Criterion Based on Graphs, without Graphs
• scientific article; zbMATH DE number 3960981 (Why is no real title available?)
• Correctness proofs of distributed termination algorithms
• Non-size increasing graph rewriting for natural language processing
• Visualization of distributed algorithms based on graph relabelling systems
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
• Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing

This page was built for publication:

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