Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
From MaRDI portal
Publication:5138353
DOI10.1007/PL00008931zbMath1448.68328OpenAlexW2089138177MaRDI QIDQ5138353
Frederic Magniette, Béatrice Bérard, Laurent Fribourg, Joffroy Beauquier
Publication date: 3 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00008931
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A belated proof of self-stabilization
- An exercise in proving self-stabilization with a variant function
- A self-stabilizing algorithm for maximal matching
- Computing with graph rewriting systems with priorities
- Self-stabilizing extensions for message-passing systems
- On the recognition of families of graphs with local computations
- Minimal and complete word unification
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Self-stabilizing systems in spite of distributed control
- Different local controls for graph relabeling systems
- Topics in termination
This page was built for publication: Proving convergence of self-stabilizing systems using first-order rewriting and regular languages