13 search results - page 1 / 3 » Model Checking Succinct and Parametric One-Counter Automata |
ICALP
2010
Springer
14 years 12 days ago
2010
Springer
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...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
ENTCS
2007
13 years 7 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
TACAS
2001
Springer
14 years 1 days ago
2001
Springer