LTL with the freeze quantifier and register automata

A data word is a sequence of pairs of a letter from a finite alphabet and an element from an infinite set, where the latter can only be compared for equality. To reason about data words, linear temporal logic is extended by the freeze quantifier, which stores the element at the current word position...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on computational logic 2009-01, Vol.10 (3), p.1-30
Hauptverfasser:	Demri, Stephane, Lazic, Ranko
Format:	Artikel
Sprache:	eng
Schlagworte:	Automation Computer Science Formal Languages and Automata Theory Logic Logic in Computer Science Mathematical analysis Operators Registers Tables (data) Temporal logic Translations
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!