Linear temporal logic for regular cost functions - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Linear temporal logic for regular cost functions

Résumé

Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is that exact values are not considered, but only estimated. In this paper, we define an extension of Linear Temporal Logic (LTL) over finite words to describe cost functions. We give an explicit translation from this new logic to automata. We then algebraically characterize the expressive power of this logic, using a new syntactic congruence for cost functions introduced in this paper.
Fichier principal
Vignette du fichier
57.pdf (145.89 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00573635 , version 1 (04-03-2011)

Identifiants

  • HAL Id : hal-00573635 , version 1

Citer

Denis Kuperberg. Linear temporal logic for regular cost functions. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.627-636. ⟨hal-00573635⟩
102 Consultations
179 Téléchargements

Partager

Gmail Facebook X LinkedIn More