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
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Timed automata and recognizability
Information Processing Letters
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite variability interpretation of monadic logic of order
Theoretical Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Digitisation and Full Abstraction for Dense-Time Model Checking
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Verifying Abstractions of Timed Systems
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Future temporal logic needs infinitely many modalities
Information and Computation
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Using mappings to prove timing properties
Distributed Computing
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Safe On-The-Fly Steady-State Detection for Time-Bounded Reachability
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Quantitative temporal logics over the reals: PSpace and below
Information and Computation
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
On Expressiveness and Complexity in Real-Time Model Checking
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Universality and language inclusion for open and closed timed automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Time-bounded verification of CTMCs against real-time specifications
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Reachability problems for hybrid automata
RP'11 Proceedings of the 5th international conference on Reachability problems
Expressive Completeness for Metric Temporal Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bounded language inclusion for timed automata is 2EXPSPACE-Complete. We also investigate the satisfiability and model-checking problems for Metric Temporal Logic (MTL), as well as monadic first- and second-order logics over the reals with order and the + 1 function (FO( It is worth recalling that, over unbounded time intervals, the satisfiability and model-checking problems listed above are all well-known to be undecidable.