Enhancing Approximations for Regular Reachability Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Enhancing Approximations for Regular Reachability Analysis


This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata representing reachable sets by merging some of their states with respect to simple syntactic criteria, or a combination of such criteria. The second approximation mechanism consists in manipulating an auxiliary automaton when applying a transducer representing the transition relation to an automaton encoding the initial states. In addition, for the second mechanism we propose a new approach to refine the approximations depending on a property of interest. The proposals are evaluated on examples of mutual exclusion protocols.
Fichier principal
Vignette du fichier
document.pdf (243.83 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00909204 , version 1 (26-11-2013)



Alois Dreyfus, Pierre-Cyrille Heam, Olga Kouchnarenko. Enhancing Approximations for Regular Reachability Analysis. CIAA 2013 - 18th International Conference on Implementation and Application of Automata - 2013, Jul 2013, Halifax, Canada. pp.331-339, ⟨10.1007/978-3-642-39274-0_29⟩. ⟨hal-00909204⟩
277 View
128 Download



Gmail Facebook X LinkedIn More