Model Checking Restricted Sets of Timed Paths
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.
Unable to display preview. Download preview PDF.
- 5.Alur, R., Kurshan, R.P., Viswanathan, M.: Membership Question for Timed and Hybrid Automata. In: Proc. 19th Symp. Real-Time Systems (RTS 98), December 1998, pp. 254–263. IEEE Comp. Soc. Press, Los Alamitos (1998)Google Scholar
- 11.Thati, P., Roşu, G.: Monitoring Algorithms for Metric Temporal Logic Specifications. In: Havelund, K., Roşu, G. (eds.) Proc. 4th Intl Workshop on Runtime Verification (RV 2004), April 2004. ENTCS, pp. 131–147. Elsevier Science, Amsterdam (2004)Google Scholar