On expressiveness and complexity in real-time model checking

29Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Metric Interval Temporal Logic (MITL) is a popular formalism for expressing real-time specifications. This logic achieves decidability by restricting the precision of timing constraints, in particular, by banning so-called punctual specifications. In this paper we introduce a significantly more expressive logic that can express a wide variety of punctual specifications, but whose model-checking problem has the same complexity as that of MITL. We conclude that for model checking the most commonly occurring specifications, such as invariance and bounded response, punctuality can be accommodated at no cost. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Bouyer, P., Markey, N., Ouaknine, J., & Worrell, J. (2008). On expressiveness and complexity in real-time model checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5126 LNCS, pp. 124–135). https://doi.org/10.1007/978-3-540-70583-3_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free