MOVES Seminar, 20 July 2009

PINS Increases NIPS' Scalability

 

 

Dr. Michael Weber (Univ of Twente, NL)

 

Abstract:

 

We present PINS, a refined interface between state-space generators and model checking algorithms, which preserves the combinatorial structure of the system. This allows to share various model checking techniques among different specification languages. Yet still sufficient detail is available to maintain efficacy. We demonstrate how both symbolic and distributed model checking become language-independent, reusable techniques. Optimizations like recursive state collapsing and transition caching can be implemented in a modular way on top of PINS, while keeping them independent of any particular input language. We experimented with an implementation of PINS. This allowed us to quickly connect tools, to experiment with languages (Promela, mCRL, ODEs), to add, compare and test out the feasibility of new ideas, and to assess their performance on case studies, e.g., from the BEEM benchmark set.  The PINS interface has been implemented within the LTSmin toolkit.