This paper introduces the abstraction of max-plus linear (MPL) systems via predicates. Predicates are automatically selected from system matrix, as well as from the specifications under consideration. We focus on verifying time-difference specifications, which encompass the relation between successive events in MPL systems. We implement a bounded model checking (BMC) procedure over a predicate abstraction of the given MPL system, to verify the satisfaction of time-difference specifications. Our predicate abstractions are experimentally shown to improve on existing MPL abstractions algorithms. Furthermore, with focus on the BMC algorithm, we can provide an explicit upper bound on the completeness threshold by means of the transient and the cyclicity of the underlying MPL system.
CITATION STYLE
Syifa’ul Mufid, M., Adzkiya, D., & Abate, A. (2019). Bounded Model Checking of Max-Plus Linear Systems via Predicate Abstractions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11750 LNCS, pp. 142–159). Springer. https://doi.org/10.1007/978-3-030-29662-9_9
Mendeley helps you to discover research relevant for your work.