wpr-verify: verification code for the Word-Processing-based Routing (WPR) scheme, version 2.1.0

Companion code for Word-Processing-based Routing: A Fault-tolerant Routing Scheme for Cayley Graphs (D. Aguirre-Guerrero, L. Fàbrega, P. Vilà). It reproduces every figure reported in the tables of the paper.

Version 2.1.0 (revised manuscript) refines the revised forwarding rule so that the failure trace carries only the failures that block the path of a message (the whole-table rule of 2.0.0 is kept as trace-full) and regenerates the multi-failure results. Version 2.0.0 added: wpr_faults.py, a simulation engine for node and link failures with sequential or concurrent notification (Algorithms 5–8) and the two forwarding rules (the rule of the original submission and the revised rule with a failure trace in the message header, Algorithms 11–12), plus a greedy failure-oblivious baseline; wpr_experiments.py, the new experiments (exhaustive two-failure verification, k concurrent failures, minimality mitigation with the affected set and blind-spot radius, instances of up to 362,880 nodes, the RCRR scenario on the 1081-node Borel Cayley graph, greedy baseline) with CSV output and a self-test; wda_cost.g and run_wda.py, which measure the size of the shortLex automatic structures (word acceptor and word-difference automata) with GAP/kbmag; and results/, the CSV files behind every table of the paper. wpr_verify.py (single failure, Tables 5, 8 and 9) and edge_transitivity.g are unchanged.

Requirements: Python ≥ 3.6 (standard library only) for the Python scripts; GAP ≥ 4.15 with the GRAPE and kbmag packages for the GAP scripts.