Lazy Reachability Analysis in Distributed Systems - Archive ouverte HAL
Conference Papers Year : 2016

Lazy Reachability Analysis in Distributed Systems

Didier Lime

Abstract

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.
Fichier principal
Vignette du fichier
CONCUR2016.pdf (663.33 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01699311 , version 1 (02-02-2018)

Identifiers

Cite

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⟩
131 View
33 Download

Altmetric

Share

More