On the relationship between reachability problems in timed and counter automata

On the relationship between reachability problems in timed and counter automata

Taispeáin leaganacha eile (1)

This paper establishes a relationship between reachability problems in timed automata and space-bounded counter automata. We show that reachability in timed automata with three or more clocks is naturally logarithmic-space interreducible with reachability in space-bounded counter automata with two c...

Cur síos iomlán

Sonraí bibleagrafaíochta
Príomhchruthaitheoirí:	Haase, C, Ouaknine, J, Worrell, J
Formáid:	Journal article
Teanga:	English
Foilsithe / Cruthaithe:	2012

Míreanna comhchosúla

On the Relationship between Reachability Problems in Timed and Counter Automata
de réir: Haase, C, et al.
Foilsithe / Cruthaithe: (2012)

Reachability in Succinct and Parametric One−Counter Automata
de réir: Haase, C, et al.
Foilsithe / Cruthaithe: (2009)

Reachability in Succinct and Parametric One-Counter Automata
de réir: Haase, C, et al.
Foilsithe / Cruthaithe: (2009)

On reachability for hybrid automata over bounded time
de réir: Brihaye, T, et al.
Foilsithe / Cruthaithe: (2011)

Branching-time model checking of parametric one-counter automata
de réir: Göller, S, et al.
Foilsithe / Cruthaithe: (2012)

Branching−Time Model Checking of Parametric One−Counter Automata
de réir: Göller, S, et al.
Foilsithe / Cruthaithe: (2012)

Revisiting reachability in timed automata
de réir: Quaas, K, et al.
Foilsithe / Cruthaithe: (2017)

Model Checking Succinct and Parametric One-Counter Automata.
de réir: Göller, S, et al.
Foilsithe / Cruthaithe: (2010)

Model Checking Succinct and Parametric One−Counter Automata
de réir: Göller, S, et al.
Foilsithe / Cruthaithe: (2010)

On reachability problems for low-dimensional matrix semigroups
de réir: Colcombet, T, et al.
Foilsithe / Cruthaithe: (2019)

On parametric timed automata and one-counter machines
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2016)

Reachability−Time Games on Timed Automata
de réir: Jurdzinski, M, et al.
Foilsithe / Cruthaithe: (2007)

Model checking flat freeze LTL on one-counter automata
de réir: Lechner, A, et al.
Foilsithe / Cruthaithe: (2016)

On the decidability of reachability in linear time-invariant systems
de réir: Fijalkow, N, et al.
Foilsithe / Cruthaithe: (2019)

Reachability and liveness in parametric timed automata
de réir: Étienne André, et al.
Foilsithe / Cruthaithe: (2022-02-01)

The pseudo-reachability problem for diagonalisable linear dynamical systems
de réir: D'Costa, J, et al.
Foilsithe / Cruthaithe: (2022)

On recurrent reachability for continuous linear dynamical systems
de réir: Ouaknine, J, et al.
Foilsithe / Cruthaithe: (2016)

On recurrent reachability for continuous linear dynamical systems
de réir: Chonev, V, et al.
Foilsithe / Cruthaithe: (2016)

Model Checking Flat Freeze LTL on One-Counter Automata
de réir: Antonia Lechner, et al.
Foilsithe / Cruthaithe: (2018-12-01)

Undecidability of universality for timed automata with minimal resources
de réir: Adams, S, et al.
Foilsithe / Cruthaithe: (2007)

Undecidability of Universality for Timed Automata with Minimal Resources
de réir: Adams, S, et al.
Foilsithe / Cruthaithe: (2007)

Reachability Problem for Weak Multi-Pushdown Automata
de réir: Wojciech Czerwiński, et al.
Foilsithe / Cruthaithe: (2013-09-01)

Alternating Timed Automata over Bounded Time
de réir: Jenkins, M, et al.
Foilsithe / Cruthaithe: (2010)

On the Complexity of the Equivalence Problem for Probabilistic Automata
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2012)

Reachability in pushdown register automata
de réir: Murawski, A, et al.
Foilsithe / Cruthaithe: (2017)

Alternating Timed Automata over Bounded Time
de réir: Jenkins, M, et al.
Foilsithe / Cruthaithe: (2010)

On the complexity of model checking counter automata
de réir: Haase, C
Foilsithe / Cruthaithe: (2012)

COMPLETELY REACHABLE ALMOST GROUP AUTOMATA
de réir: David Fernando Casas Torres
Foilsithe / Cruthaithe: (2024-12-01)

Universality Analysis for One-Clock Timed Automata
de réir: Abdulla, P, et al.
Foilsithe / Cruthaithe: (2008)

Decidability and complexity results for timed automata via channel machines
de réir: Abdulla, P, et al.
Foilsithe / Cruthaithe: (2005)

Zone-based universality analysis for single-clock timed automata
de réir: Abdulla, P, et al.
Foilsithe / Cruthaithe: (2007)

Improved Undecidability Results for Reachability Games on Recursive Timed Automata
de réir: Shankara Narayanan Krishna, et al.
Foilsithe / Cruthaithe: (2014-08-01)

Language equivalence for probabilistic automata
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2011)

Algebraic invariants for linear hybrid automata
de réir: Majumdar, R, et al.
Foilsithe / Cruthaithe: (2020)

On a reachability set of automaton counter machines
de réir: E. V. Kuzmin, et al.
Foilsithe / Cruthaithe: (2010-03-01)

Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
de réir: Jovanovic, A, et al.
Foilsithe / Cruthaithe: (2017)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
de réir: Kiefer, S, et al.
Foilsithe / Cruthaithe: (2013)

On a reachability set of automaton 3-counter machines
de réir: E. V. Kuzmin, et al.
Foilsithe / Cruthaithe: (2009-09-01)

Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
de réir: Rayna Dimitrova, et al.
Foilsithe / Cruthaithe: (2015-09-01)

Revisiting the Equivalence Problem for Finite Multitape Automata
de réir: Worrell, J
Foilsithe / Cruthaithe: (2013)