Order Independent Temporal Properties - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Logic and Computation Year : 2004

Order Independent Temporal Properties

Abstract

The paper investigates temporal properties that are invariant with respect to the temporal ordering and that are expressible by temporal query languages either explicit like FO(≤) or implicit like TL. In the case of an explicit time representation, these "order invariant" temporal properties are simply those expressible in the language FO(=). In the case of an implicit time representation, we introduce a new language, TL(E i) that captures exactly these properties. The expressive power of the language TL(E i) is characterized via a gameà la Ehrenfeucht-Fraïssé. This provides another proof, using a more classical technique, that the implicit temporal language TL is strictly less expressive than the explicit temporal language FO(≤). This alternative proof is interesting by itself and opens new perspectives in the investigation of results of the same kind for more expressive implicit temporal languages than TL.
Fichier principal
Vignette du fichier
journal.pdf (312.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02887779 , version 1 (02-07-2020)

Identifiers

Cite

Nicole Bidoit, Sandra de Amo, Luc Segoufin. Order Independent Temporal Properties. Journal of Logic and Computation, 2004, 14 (2), pp.277-298. ⟨10.1093/logcom/14.2.277⟩. ⟨hal-02887779⟩
23 View
87 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More