Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incompleteness of first-order temporal logic with until
Theoretical Computer Science
Temporal logic for real time systems
Temporal logic for real time systems
Half-order modal logic: how to prove real-time properties
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The existence of refinement mappings
Theoretical Computer Science
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A really abstract concurrent model and its temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Specifying Message Passing and Time-Critical Systems with Temporal Logic
Specifying Message Passing and Time-Critical Systems with Temporal Logic
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Proceedings of the Conference on Logic of Programs
The anchored version of the temporal framework
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Semantics and Completeness of Duration Calculus
Proceedings of the Real-Time: Theory in Practice, REX Workshop
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Synthesis of communicating processes from temporal logic specifications
Synthesis of communicating processes from temporal logic specifications
Quantitative temporal logics over the reals: PSpace and below
Information and Computation
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed event clock automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
Towards an algebra for real-time programs
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Hi-index | 5.23 |
This paper presents a complete axiomatization of two decidable propositional real-time linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic with past (MetricIntervalTL). The completeness proof consists of an effective proof building procedure for EventClockTL. From this result we obtain a complete axiomatization of MetricIntervalTL by providing axioms translating MetricIntervalTL formulae into EventClockTL formulae, the two logics being equally expressive. Our proof is structured to yield axiomatizations also for interesting fragments of these logics, such as the linear temporal logic of the real numbers (TLR).