par Schobbens, Pierre-Yves 
;Raskin, Jean-François ;Henzinger, Thomas A.
Référence Theoretical computer science, 274, 1-2, page (151-182)
Publication Publié, 2002-03
;Raskin, Jean-François ;Henzinger, Thomas A.Référence Theoretical computer science, 274, 1-2, page (151-182)
Publication Publié, 2002-03
Article révisé par les pairs
| Résumé : | 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). © 2002 Published by Elsevier Science B.V. |
