Abstract
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of restricted sets of timed paths that we consider are (i) a single finite (or ultimately periodic) timed path, (ii) a infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a region graph, (iii) a Infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a zone graph. © Springer-Verlag 2004.
Cite
CITATION STYLE
Markey, N., & Raskin, J. F. (2004). Model checking restricted sets of timed paths. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3170, 432–447. https://doi.org/10.1007/978-3-540-28644-8_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
