Publication details
Reachability analysis for timed automata using max
-plus algebra
| Basic information | |
|---|---|
| Original title: | Reachability analysis for timed automata using max -plus algebra |
| Authors: | Qi Lu, Michael Madsen, Martin Milata, Soren Ravn, Uli Fahrenberg, Kim G. Larsen |
| Further information | |
|---|---|
| Citation: | LU, Qi, Michael MADSEN, Martin MILATA, Søren RAVN, Uli
FAHRENBERG and Kim G. LARSEN. Reachability analysis for timed
automata using max -plus algebra. Journal of Logic and Algebraic
Programming, Holland: Elsevier, 2012, vol. 81, No 3, p.
298 -313. ISSN 1567 -8326. doi:10.1016/j.jlap.2011.10.004.Export BibTeX |
| Original language: | English |
| Field: | Informatics |
| WWW: | http://www.sciencedirect.com/science/article/pii/S156783261100097X |
| Type: | Article in Periodical |
| Keywords: | Timed automaton; Real -time model checking; Data structure; Max -plus algebra; Max -plus polyhedron |
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.
Related projects:
- Czech Republic membership in the European Research Consortium for Informatics and Mathematics
- Rozsáhlé výpočetní systémy: modely, aplikace a verifikace











http://www.sciencedirect.com/science/article/pii/S156783261100097X