Model checking succinct and parametric one-counter automata

Authors:
Stefan Göller;Christoph Haase;Joël Ouaknine;James Worrell
Affiliations:
Universität Bremen, Institut für Informatik, Germany;Oxford University, Computing Laboratory, UK;Oxford University, Computing Laboratory, UK;Oxford University, Computing Laboratory, UK
Venue:
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Year:
2010

Citing 12
Cited 1

New Decidability Results Concerning Two-way Counter Machines and Applications

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
DP Lower bounds for equivalence-checking and model-checking of one-counter automata

Information and Computation
On validation of XML streams using finite state machines

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
On the solvability of a class of diophantine equations and applications

Theoretical Computer Science
Reachability in Succinct and Parametric One-Counter Automata

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
The Effects of Bounding Syntactic Resources on Presburger LTL

Journal of Logic and Computation
Parity games played on transition graphs of one-counter processes

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Flat parametric counter automata

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Flat counter automata almost everywhere!

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Programs with lists are counter automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
On decidability within the arithmetic of addition and divisibility

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Branching-Time model checking of parametric one-counter automata

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which additive updates are encoded in binary, as well as parametric one-counter automata, in which additive updates may be given as unspecified parameters. We fully determine the complexity of model checking these automata against CTL, LTL, and modal µ-calculus specifications.