Paper Info
Title
VeriSiMPL: verification via bisimulations of MPL models
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/
Year
DOI
Venue
2013
10.1007/978-3-642-40196-1_22
QEST
Keywords
Field
DocType
labeled transition,spin model checker,lts abstraction,finite abstraction,difference-bound matrices,mpl model,abstraction procedure,concrete mpl model,leverages sparse representation,fast manipulation
Data structure,Programming language,Abstraction,MATLAB,Computer science,Vector calculus,Theoretical computer science,Linear temporal logic,Promela,Precedence graph,SPIN model checker
Conference
Citations 
PageRank 
References 
4
0.45
5
Authors
2
Name
Order
Citations
PageRank
Dieky Adzkiya1358.29
Alessandro Abate2109894.52