Reasoning about Data Repetitions with Counter Systems

DOI10.1109/LICS.2013.8zbMath1366.68202arXiv1604.02887OpenAlexW1965282409MaRDI QIDQ5271038

M. Praveen, Diego Figueira, Stéphane P. Demri

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02887

zbMATH Keywords

reachabilitytemporal logicdata wordscoverabilitycounter systemsrepeating values, satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (5)

Unnamed Item ⋮ On temporal logics with data variable quantifications: decidability and complexity ⋮ Unnamed Item ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ On Freeze LTL with Ordered Attributes

This page was built for publication: Reasoning about Data Repetitions with Counter Systems