Branching-Time Model Checking of Parametric One-Counter Automata

DOI10.1007/978-3-642-28729-9_27zbMath1352.68153OpenAlexW1524128696MaRDI QIDQ2892786

Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28729-9_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) 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 ⋮ Unnamed Item ⋮ Temporal Specifications with Accumulative Values ⋮ The Complexity of Flat Freeze LTL

This page was built for publication: Branching-Time Model Checking of Parametric One-Counter Automata