Reachability in Succinct and Parametric One-Counter Automata

Reachability in Succinct and Parametric One-Counter Automata

Show other versions (1)

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-which we refer to as the succinct encoding. It is easily seen that the reachability problem for this class of machines is i...

Full description

Bibliographic Details
Main Authors:	Haase, C, Kreutzer, S, Ouaknine, J, Worrell, J
Format:	Book section
Published:	2009

Similar Items

Reachability in Succinct and Parametric One−Counter Automata
by: Haase, C, et al.
Published: (2009)

Model Checking Succinct and Parametric One-Counter Automata.
by: Göller, S, et al.
Published: (2010)

Model Checking Succinct and Parametric One−Counter Automata
by: Göller, S, et al.
Published: (2010)

On the relationship between reachability problems in timed and counter automata
by: Haase, C, et al.
Published: (2012)

On the Relationship between Reachability Problems in Timed and Counter Automata
by: Haase, C, et al.
Published: (2012)

Branching-time model checking of parametric one-counter automata
by: Göller, S, et al.
Published: (2012)

Branching−Time Model Checking of Parametric One−Counter Automata
by: Göller, S, et al.
Published: (2012)

On parametric timed automata and one-counter machines
by: Ouaknine, J, et al.
Published: (2016)

On reachability for hybrid automata over bounded time
by: Brihaye, T, et al.
Published: (2011)

Revisiting reachability in timed automata
by: Quaas, K, et al.
Published: (2017)

Reachability and liveness in parametric timed automata
by: Étienne André, et al.
Published: (2022-02-01)

Model checking flat freeze LTL on one-counter automata
by: Lechner, A, et al.
Published: (2016)

Model Checking Flat Freeze LTL on One-Counter Automata
by: Antonia Lechner, et al.
Published: (2018-12-01)

Countdown games, and simulation on (succinct) one-counter nets
by: Petr Jancar, et al.
Published: (2023-02-01)

On recurrent reachability for continuous linear dynamical systems
by: Ouaknine, J, et al.
Published: (2016)

On recurrent reachability for continuous linear dynamical systems
by: Chonev, V, et al.
Published: (2016)

Succinctness of two-way probabilistic and quantum finite automata
by: Abuzer Yakaryilmaz, et al.
Published: (2010-01-01)

On reachability problems for low-dimensional matrix semigroups
by: Colcombet, T, et al.
Published: (2019)

Reachability in pushdown register automata
by: Murawski, A, et al.
Published: (2017)

Universality Analysis for One-Clock Timed Automata
by: Abdulla, P, et al.
Published: (2008)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Shibashis Guha, et al.
Published: (2024-01-01)

On the complexity of model checking counter automata
by: Haase, C
Published: (2012)

On the decidability of reachability in linear time-invariant systems
by: Fijalkow, N, et al.
Published: (2019)

Reachability−Time Games on Timed Automata
by: Jurdzinski, M, et al.
Published: (2007)

The pseudo-reachability problem for diagonalisable linear dynamical systems
by: D'Costa, J, et al.
Published: (2022)

Undecidability of Universality for Timed Automata with Minimal Resources
by: Adams, S, et al.
Published: (2007)

Undecidability of universality for timed automata with minimal resources
by: Adams, S, et al.
Published: (2007)

Reachability Problem for Weak Multi-Pushdown Automata
by: Wojciech Czerwiński, et al.
Published: (2013-09-01)

Regular Separability of One Counter Automata
by: Wojciech Czerwiński, et al.
Published: (2019-06-01)

On a reachability set of automaton counter machines
by: E. V. Kuzmin, et al.
Published: (2010-03-01)

Language equivalence for probabilistic automata
by: Kiefer, S, et al.
Published: (2011)

Algebraic invariants for linear hybrid automata
by: Majumdar, R, et al.
Published: (2020)

Weighted omega-Restricted One Counter Automata
by: Manfred Droste, et al.
Published: (2018-03-01)

Alternating Timed Automata over Bounded Time
by: Jenkins, M, et al.
Published: (2010)

On the Complexity of the Equivalence Problem for Probabilistic Automata
by: Kiefer, S, et al.
Published: (2012)

On a reachability set of automaton 3-counter machines
by: E. V. Kuzmin, et al.
Published: (2009-09-01)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
by: Kiefer, S, et al.
Published: (2013)

Alternating Timed Automata over Bounded Time
by: Jenkins, M, et al.
Published: (2010)

Improved Undecidability Results for Reachability Games on Recursive Timed Automata
by: Shankara Narayanan Krishna, et al.
Published: (2014-08-01)

Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
by: Rayna Dimitrova, et al.
Published: (2015-09-01)