VeriSIMPL 2: an open-source software for the verification of max-plus-linear systems. This work presents a technique to generate finite abstractions of autonomous Max-Plus-Linear (MPL) systems, a class of discrete-event systems employed to characterize the dynamics of the timing related to the synchronization of successive events. Abstractions of MPL systems are derived as finite-state transition systems. A transition system is obtained first by partitioning the state space of the MPL system into finitely many regions and then by associating a unique state of the transition system to each partitioning region. Relations among the states of the transition system are then set up based on the underlying dynamical transitions between the corresponding partitioning regions of the MPL state space. In order to establish formal equivalences, the obtained finite abstractions are proven either to simulate or to bisimulate the original MPL system. The approach enables the study of general properties of the original MPL system formalized as logical specifications, by verifying them over the finite abstraction via model checking. The article presents a new, extended and improved implementation of a software tool (available online) for the discussed formal abstraction of MPL systems, and is tested on a numerical benchmark against a previous version.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Cândido, Renato Markele Ferreira; Hardouin, Laurent; Lhommeau, Mehdi; Santos Mendes, Rafael: Conditional reachability of uncertain max plus linear systems (2018)
- Adzkiya, Dieky; Zhang, Yining; Abate, Alessandro: \textttVeriSIMPL2: an open-source software for the verification of max-plus-linear systems (2016)
- Adzkiya, Dieky; De Schutter, Bart; Abate, Alessandro: Computational techniques for reachability analysis of Max-Plus-Linear systems (2015)
- Adzkiya, Dieky; Abate, Alessandro: Verisimpl: Verification via bisimulations of MPL models (2013) ioport