Reachability analysis for timed automata using max-plus algebra

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00059430" target="_blank" >RIV/00216224:14330/12:00059430 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jlap.2011.10.004" target="_blank" >http://dx.doi.org/10.1016/j.jlap.2011.10.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jlap.2011.10.004" target="_blank" >10.1016/j.jlap.2011.10.004</a>

Result language
angličtina
Original language name
Reachability analysis for timed automata using max-plus algebra
Original language description
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 modelchecker opaal.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/LA09016" target="_blank" >LA09016: Czech Republic membership in the European Research Consortium for Informatics and Mathematics (ERCIM)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)