论文信息 - On Parameterized One-Counter Automata - 字舞流文

On Parameterized One-Counter Automata

We show that reachability and repeated reachability in parameterized one-counter automata with unary updates are NP-complete.

Benedikt Bollig | Arnaud Sangnier | Karin Quaas

[1] Pascal Lafourcade,et al. Intruder Deduction for AC-Like Equational Theories with Homomorphisms , 2005, RTA.

[2] Stéphane Demri,et al. When Model-Checking Freeze LTL over Counter Machines Becomes Decidable , 2010, FoSSaCS.

[3] Olivier Serre,et al. Parity Games Played on Transition Graphs of One-Counter Processes , 2006, FoSSaCS.

[4] Joël Ouaknine,et al. Model Checking Succinct and Parametric One-Counter Automata , 2010, ICALP.

[5] Stéphane Demri,et al. The Effects of Bounding Syntactic Resources on Presburger LTL , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[6] Zvi Galil,et al. Hierarchies of complete problems , 1976, Acta Informatica.

[7] Joël Ouaknine,et al. Model Checking Flat Freeze LTL on One-Counter Automata , 2016, CONCUR.

[8] Joël Ouaknine,et al. Reachability in Succinct and Parametric One-Counter Automata , 2009, CONCUR.