Specifying real-time properties with metric temporal logic
Real-Time Systems
Journal of the ACM (JACM)
Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Model-checking in dense real-time
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)
Computing Accumulated Delays in Real-time Systems
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Hybrid Systems
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
On-the-fly symbolic model checking for real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Membership Questions for Timed and Hybrid Automata
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems
Autonomous Agents and Multi-Agent Systems
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Synchronizing AMS Assertions with AMS Simulation: From Theory to Practice
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
In this paper, we study the complexity of model-checking formulas of four important real-time logics (TPTL, 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) an infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a region graph, (iii) an infinite set of finite (or infinite) timed paths defined by a finite (or ultimately periodic) path in a zone graph.Several results are quite negative: TPTL and MTL remain undecidable along region-and zone-paths. On the other hand, we obtained PTIME algorithms for model-checking TCTL along a region path, and for MTL along a single timed path.