On-line model checking is a recent technique to overcome limitations of model checking if accurate system models are not available. At certain times during on-line model checking it is necessary to adjust the current model state to the real-world state and to do so in an efficient way. This paper presents a general, graph-based transformation reduction and applies it to reduce the length of transformation sequences needed to reach particular states in the model checker UPPAAL. Our evaluation shows that, generally, for the length of those sequences upper bounds exist independently from the elapsed time in the system. It follows that our proposed method is capable of fulfilling the real-time requirements imposed by on-line model checking. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Rinast, J., Schupp, S., & Gollmann, D. (2014). A graph-based transformation reduction to reach UPPAAL states faster. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8442 LNCS, pp. 547–562). Springer Verlag. https://doi.org/10.1007/978-3-319-06410-9_37
Mendeley helps you to discover research relevant for your work.