||We report on recent research lines related to parameterized verification and model checking applied
to formal models of distributed algorithms. Both approaches are based on graph rewriting and graph transformation systems.
Case-studies include distributed mutual exclusion protocols like Ricart-Agrawala,
routing protocols like link reversal, and distributed consensus protocols like Paxos.
Verification algorithms for restricted classes of models exploit finite-state abstractions, symbolic representations
based on graph orderings, the theory of well-structured transition systems, and reachability algorithms
based on labeling procedures.