Reachability analysis for timed automata using max-plus algebra - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logic and Algebraic Programming Year : 2012

Reachability analysis for timed automata using max-plus algebra

Abstract

We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed to perform forward and backward reachability analysis using max-plus polyhedra. To show that the approach works in practice and theory alike, we have created a proof-of-concept implementation on top of the model checker opaal.
Fichier principal
Vignette du fichier
jlp.pdf (531.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01087998 , version 1 (27-11-2014)

Identifiers

Cite

Qi Lu, Michael Madsen, Martin Milata, Søren Ravn, Uli Fahrenberg, et al.. Reachability analysis for timed automata using max-plus algebra. Journal of Logic and Algebraic Programming, 2012, 81, pp.298 - 313. ⟨10.1016/j.jlap.2011.10.004⟩. ⟨hal-01087998⟩
202 View
128 Download

Altmetric

Share

Gmail Facebook X LinkedIn More