Automata and temporal logic over arbitrary linear time - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Automata and temporal logic over arbitrary linear time

Résumé

Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running systems. One can consider more general models for linear time, using words indexed by arbitrary linear orderings. We investigate the connections between temporal logic and automata on linear orderings, as introduced by Bruyère and Carton. We provide a doubly exponential procedure to compute from any LTL formula with Until, Since, and the Stavi connectives an automaton that decides whether that formula holds on the input word. In particular, since the emptiness problem for these automata is decidable, this transformation gives a decision procedure for the satisfiability of the logic.
Fichier principal
Vignette du fichier
temporal3.pdf (148.9 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00553818 , version 1 (09-01-2011)

Identifiants

Citer

Julien Cristau. Automata and temporal logic over arbitrary linear time. Foundations of Software Technology and Theoretical Computer Science, Dec 2009, Kanpur, India. pp.133-144, ⟨10.4230/LIPIcs.FSTTCS.2009.2313⟩. ⟨hal-00553818⟩
45 Consultations
67 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More