Nov 11, 2014: Jeroen Meijer: Improving reachability analysis in LTSmin

November 11, 2014Improving reachability analysis in LTSmin
Room: Carre 2GJeroen Meijer
12:30-13:30

We present methods at improving symbolic model checking for explicit state modeling languages, e.g., Promela, DVE and mCRL2. The modular PINS architecture of LTSmin supports a notion of event locality, by merely indicating for each event on which variables it depends. However, one could distinguish four separate dependencies: read, may-write, must-write and copy. In this talk, we introduce these notions in a language-independent manner. In particular, models with arrays need to distinguish overwriting and copying of values.

We also adapt the symbolic model checking algorithms to exploit the refined dependency information. We have implemented refined dependency matrices for Promela, DVE and mCRL2, in order to compare our new algorithms to the original version of LTSmin. The results show that the amount of successor computations and memory footprint are greatly reduced. Finally, the optimal variable ordering is also affected by the refined dependencies: We determined experimentally that variables with a read dependency should occur at a higher BDD level than variables with a write dependency.