Safety analysis of timing properties in real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Applications of temporal logic to the specification of real time systems (extended abstract)
Proceedings of a Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Specifying real-time properties with metric temporal logic
Real-Time Systems
On the development of reactive systems
Logics and models of concurrent systems
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
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 Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem
ICAL '99 Proceedings of the 26th 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
Quantitative Temporal Reasoning
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Automata-theoretic decision of timed games
Theoretical Computer Science
| Hi-index | 0.00 |
Timed computation tree logic (TCTL) extends CTL by allowing timing constraints on the temporal operators. The semantics of Tctl is defined on a dense tree. The satisfiability of TCTL-formulae is undecidable even if the structures are restricted to dense trees obtained from timed graphs. According to the known results there are two possible causes of such undecidability: the denseness of the underlying structure and the equality in the timing constraints. We prove that the second one is the only source of undecidability when the structures are defined by timed graphs. In fact, if the equality is not allowed in the timing constraints of TCTL-formulae then the finite satisfiability in TCTL is decidable. We show this result by reducing this problem to the emptiness problem of timed tree automata, so strengthening the already well-founded connections between finite automata and temporal logics.