Equivalence between model-checking flat counter systems and Presburger arithmetic

We show that model-checking flat counter systems with the branching-time temporal logic CTL* extended with arithmetical constraints on counter values has the same worst-case complexity as the satisfiability problem for Presburger arithmetic. The lower bound already holds with strong restrictions: th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2018-07, Vol.735, p.2-23
Hauptverfasser:	Demri, Stéphane, Dhar, Amit Kumar, Sangnier, Arnaud
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science CTL Flat counter systems Logic in Computer Science Model-checking Presburger arithmetic Temporal logic
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!