VeriSiMPL: verification via bisimulations of MPL models

  • Authors:
  • Dieky Adzkiya;Alessandro Abate

  • Affiliations:
  • Delft Center for Systems and Control, TU Delft, The Netherlands;Department of Computer Science, University of Oxford, UK

  • Venue:
  • QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

VeriSiMPL ("very simple") is a software tool to obtain finite abstractions of Max-Plus-Linear (MPL) models. MPL models (Sect. 2), specified in MATLAB, are abstracted to Labeled Transition Systems (LTS). The LTS abstraction is formally put in relationship with the concrete MPL model via a (bi)simulation relation. The abstraction procedure (Sect. 3) runs in MATLAB and leverages sparse representations, fast manipulations based on vector calculus, and optimized data structures such as Difference-Bound Matrices. LTS abstractions can be exported to structures defined in the PROMELA. This enables the verification of MPL models against temporal specifications within the SPIN model checker (Sect. 4). The toolbox is available at http://sourceforge.net/projects/verisimpl/