Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
From MaRDI portal
Recommendations
Cites work
- A belated proof of self-stabilization
- A self-stabilizing algorithm for maximal matching
- An exercise in proving self-stabilization with a variant function
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Computing with graph rewriting systems with priorities
- Different local controls for graph relabeling systems
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 3577484 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 789389 (Why is no real title available?)
- Minimal and complete word unification
- On the recognition of families of graphs with local computations
- Self-stabilizing extensions for message-passing systems
- Self-stabilizing systems in spite of distributed control
- Topics in termination
Cited in
(2)
This page was built for publication: Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138353)