We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of "runtime verification" but it also appears in many other situations. By considering several extended temporal logics, we show that the problem of model checking a path can usually be solved efficiently, and profit from specialized algorithms. We further show it is possible to efficiently check paths given in compressed form. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Markey, N., & Schnoebelen, P. (2003). Model checking a path (preliminary report). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2761, 251–265. https://doi.org/10.1007/978-3-540-45187-7_17
Mendeley helps you to discover research relevant for your work.