On Expressiveness and Complexity in Real-Time Model Checking

Authors:
Patricia Bouyer;Nicolas Markey;Joël Ouaknine;James Worrell
Affiliations:
Oxford University Computing Laboratory, and Laboratoire Spécification & Vééérification,;Laboratoire Spécification & Vééérification,;Oxford University Computing Laboratory,;Oxford University Computing Laboratory,
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Year:
2008

Citing 16
Cited 8

Specifying real-time properties with metric temporal logic

Real-Time Systems
Real-time logics: complexity and expressiveness

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
The benefits of relaxing punctuality

Journal of the ACM (JACM)
Constructing automata from temporal logic formulas: a tutorial

Lectures on formal methods and performance analysis
The Regular Real-Time Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
It's About Time: Real-Time Logics Reviewed

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Flatness Is Not a Weakness

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
The Glory of the Past

Proceedings of the Conference on Logic of Programs
Logics and Models of Real Time: A Survey

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Timer formulas and decidable metric temporal logic

Information and Computation
On the freeze quantifier in Constraint LTL: Decidability and complexity

Information and Computation
Quantitative temporal logics over the reals: PSpace and below

Information and Computation
The Cost of Punctuality

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On metric temporal logic and faulty turing machines

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
From MITL to timed automata

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems

Some Recent Results in Metric Temporal Logic

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Weak Alternating Timed Automata

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Time-Bounded Verification

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Towards a theory of time-bounded verification

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On expressive powers of timed logics: comparing boundedness, non-punctuality, and deterministic freezing

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
The unary fragments of metric interval temporal logic: bounded versus lower bound constraints

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities
A Translation of the Existential Model Checking Problem from MITL to HLTL

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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 punctualspecifications. 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.