Partial Order Reduction for State/Event LTL

Abstract

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL [6,5] incorporates both states and events to express important properties of component-based software systems.The main contribution of the paper is a partial order reduction technique for verification of state/event LTL properties. The core of the partial order reduction is a novel notion of stuttering equivalence which we call state/event stuttering equivalence. The positive attribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weak state/event LTL, which is invariant under the new equivalence.

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

“…The correctness proof in [17] does not deal properly with this disparity. Further investigation shows that the same problem also occurs in two works of Beneš et al [2,3], who apply ample sets to state/event LTL model checking.…”

“…Although Beneš et al [2,3] rely on ample sets, and not on stubborn sets, they also discuss weak trace equivalence and stutter-trace equivalence. In fact, they present an equivalence relation for traces that is a combination of weak and stutter equivalence.…”

An automated technique to support the verification and validation of simulation models

“…For SE-LTL, we follow [6,9] and associate action labels with the starting state of a corresponding event (with the marginal adjustment that action labels are taken from a set APe). We recall the semantics of LTL for infinite traces.…”

“…State/event linear temporal logic (SE-LTL) [6,9] Definition 1 (SE-LTL). Let AP = APe U APs be a set of atomic propositions with two disjoint subsets.…”

CoInDiVinE: Parallel Distributed Model Checker for Component-Based Systems

“…Our tool employs common methods (parallelism, distributed computing, state space reduction) to fight the state-space explosion. There are different kinds of state space reduction, such as bisimulation minimization [10] or partial order reduction [6]. Our tool provides the latter.…”