On the Complexity of Verifying Regular Properties on Flat Counter Systems,
From MaRDI portal
Publication:5327431
DOI10.1007/978-3-642-39212-2_17zbMath1334.68130arXiv1304.6301OpenAlexW1604320880MaRDI QIDQ5327431
Stéphane P. Demri, Arnaud Sangnier, Amit Kumar Dhar
Publication date: 7 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6301
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic ⋮ Equivalence between model-checking flat counter systems and Presburger arithmetic ⋮ Verification of Flat FIFO Systems ⋮ Unnamed Item ⋮ Taming past LTL and flat counter systems
This page was built for publication: On the Complexity of Verifying Regular Properties on Flat Counter Systems,
