State-of-the-Art Model Checking for B and Event-B Using ProB and LTSmin

Abstract

In previous work, we presented symbolic reachability analysis by linking ProB, an animator and model checker for B and Event-B, and LTSmin, a language-independent model checker offering state-ofthe-art model checking algorithms. Although the results seemed very promising, it was a very basic integration of these tools and much potential of LTSmin was not covered by the implementation. In this paper, we present a much more mature version of this tool integration. In particular, explicit-state model checking, efficient verification of state invariants, model checking of LTL properties, as well as partial order reduction and proper multi-core model checking are now available. The (improved) performance of this advanced tool link is benchmarked on a series of models with various sizes and compared to ProB.

Optimal compression of combinatorial state spaces

“…LTSmin is a language-independent model checker based on a partitioned next-state interface [23]. We exploit this property to investigate the compression ratios of the Compact Tree for four different input types: DVE models written for the DiVinE model checker [1], Promela models written for the spin model checker [20], process algebra models written for the mCRL2 model checker [13], Petri net models from the MCC contest [27], and EventB/ProB models from LTSmin's ProB frontend [2,28]. Table 2 provides an overview of the models in each of these input formats and a justification for the selection criterion used.…”

“…EventB/ProB All models from [28] which complete within 10 h in sequential LTSmin Fig. 8 Compressed sizes in Compact Tree for all benchmarks against the length k of the uncompressed state vector sizes of the state vectors against the length of the uncompressed vector.…”

“…-New experiments using the ProB models [2,28], adding more evidence that compact tree compression works regardless of the input language.…”