Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs: (1) generation of fault-span. the set of states reachable in the presence of faults. and (2) resolving deadlock states. from where the program has no outgoing transitions. https://thebrickes.shop/product-category/napkin/