Towards Parallel Verification of Concurrent Systems using the Symbolic Observation Graph

An efficient way to cope with the combinatorial explosion problem induced by the model checking process is to compute the Symbolic Observation Graph (SOG). Given an stuttering invariant event-based LTL formula φ, involving a subset of actions E (called observed actions), the SOG is a condensed representation of the state space graph based on a symbolic encoding of the nodes (sets of states linked with unobserved actions) and an explicit representation of the edges (labelled with observed actions only). It has the advantage to be much reduced comparing to the original state space graph while being equivalent with respect to linear time properties (i.e., the original state space graph satisfies φ if and only if the corresponding SOG satisfies φ). Aiming to go further in the process of tackling the state space explosion problem, we propose in this paper to parallelize the construction of the SOG using a hybrid approach (distributed+shared memory). Doing so, we take advantage of the recent advances in computer hardware, by distributing the construction process over a large number of multi-core processors. We studied the performances of our new approach comparing to both distributed and shared memory approaches on one side, and to the sequential construction of the SOG, on the other hand. The obtained results show that the proposed approach offers an interesting alternative allowing to completely exploit the available distributed architecture while offering significant speedup.