Partial Order Reductions using Compositional Confluence Detection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Partial Order Reductions using Compositional Confluence Detection

Abstract

Explicit state methods have proven useful in verifying safety critical systems containing concurrent processes that run asynchronously and communicate. Such methods consist of inspecting the states and transitions of a graph representation of the system. Their main limitation is state explosion, which happens when the graph is too large to be stored in the available computer memory. Several techniques can be used to palliate state explosion, such as on-the-fly verification, compositional verification, and partial order reductions. In this paper, we propose a new technique of partial order reductions based on compositional confluence detection (Ccd), which can be combined with the techniques mentioned above. Ccd is based upon a generalization of the notion of confluence defined by Milner and exploits the fact that synchronizing transitions hat are confluent in the individual processes yield a confluent transition in the system graph. It thus consists of analysing the transitions of the individual process graphs and the synchronization structure to identify such confluent transitions compositionally. Under some additional conditions, the confluent transitions can be given priority over the other transitions, thus enabling graph reductions. We propose two such additional conditions: one ensuring that the generated graph is equivalent to the original system graph modulo branching bisimulation, and one ensuring that the generated graph contains the same deadlock states as the original system graph. We also describe how Ccd-based reductions were implemented in the Cadp toolbox, and present examples and case study in which adding Ccd improves reductions with respect to compositional verification and other partial order reductions.
Fichier principal
Vignette du fichier
Lang-Mateescu-09.pdf (211.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00423583 , version 1 (12-10-2009)

Identifiers

  • HAL Id : inria-00423583 , version 1

Cite

Frédéric Lang, Radu Mateescu. Partial Order Reductions using Compositional Confluence Detection. 16th International Symposium on Formal Methods FM'2009, Nov 2009, Eindhoven, Netherlands. ⟨inria-00423583⟩
123 View
265 Download

Share

Gmail Facebook X LinkedIn More