Lazy Reachability Analysis in Distributed Systems

Loïg Jezequel (1) , Didier Lime (2)

1 LS2N - Laboratoire des Sciences du Numérique de Nantes
2 ECN - École Centrale de Nantes

We address the problem of reachability in distributed systems, modelled as networks of finite automata and propose and prove a new algorithm to solve it efficiently in many cases. This algorithm allows to decompose the reachability objective among the components, and proceeds by constructing partial products by lazily adding new components when required. It thus constructs more and more precise over-approximations of the complete product. This permits early termination in many cases, in particular when the objective is not reachable, which often is an unfavorable case in reachability analysis. We have implemented this algorithm in a first prototype and provide some very encouraging experimental results.

Domaines: Théorie et langage formel [cs.FL]; Algorithme et structure de données [cs.DS]

Loïg Jezequel, Didier Lime. Lazy Reachability Analysis in Distributed Systems. 27th International Conference on Concurrency Theory (CONCUR 2016), Aug 2016, Québec, Canada. ⟨10.4230/LIPIcs.CONCUR.2016.17⟩. ⟨hal-01699311⟩