2015
DOI: 10.1007/s10626-015-0218-x
|View full text |Cite
|
Sign up to set email alerts
|

VeriSiMPL 2: An open-source software for the verification of max-plus-linear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0
2

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3
1

Relationship

5
4

Authors

Journals

citations
Cited by 10 publications
(13 citation statements)
references
References 30 publications
0
11
0
2
Order By: Relevance
“…In this implementation, the process to compute transition requires a long computation time. Then the implementation has been improved by using tree data structure in JAVA language [12]. This implementation successfully accelerates the computational time but requires a larger memory allocation because its functions are recursive.…”
Section: Introductionmentioning
confidence: 99%
“…In this implementation, the process to compute transition requires a long computation time. Then the implementation has been improved by using tree data structure in JAVA language [12]. This implementation successfully accelerates the computational time but requires a larger memory allocation because its functions are recursive.…”
Section: Introductionmentioning
confidence: 99%
“…VeriSiMPL This toolbox [1,4] is used to generate finite abstractions and reachability of max-plus-linear (MPL) systems. VeriSiMPL leverages the piecewise affine (PWA) dynamics generated from an MPL system and some operations over difference-bound matrices (DBM) [13].…”
Section: Participating Toolsmentioning
confidence: 99%
“…VeriSiMPL This toolbox [1,4] is used to generate finite abstractions and reachability of max-plus-linear (MPL) systems. VeriSiMPL leverages the piecewise affine (PWA) dynamics generated from an MPL system and some operations over difference-bound matrices (DBM) [10].…”
Section: Participating Toolsmentioning
confidence: 99%