On the relationship between reachability problems in timed and counter automata

On the relationship between reachability problems in timed and counter automata

Show other versions (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...

Bibliografske podrobnosti
Main Authors:	Haase, C, Ouaknine, J, Worrell, J
Format:	Journal article
Jezik:	English
Izdano:	2012

Podobne knjige/članki

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

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

Reachability in Succinct and Parametric One-Counter Automata
od: Haase, C, et al.
Izdano: (2009)

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

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

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

Revisiting reachability in timed automata
od: Quaas, K, et al.
Izdano: (2017)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Reachability in pushdown register automata
od: Murawski, A, et al.
Izdano: (2017)

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

On the complexity of model checking counter automata
od: Haase, C
Izdano: (2012)

COMPLETELY REACHABLE ALMOST GROUP AUTOMATA
od: David Fernando Casas Torres
Izdano: (2024-12-01)

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

Decidability and complexity results for timed automata via channel machines
od: Abdulla, P, et al.
Izdano: (2005)

Zone-based universality analysis for single-clock timed automata
od: Abdulla, P, et al.
Izdano: (2007)

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

Language equivalence for probabilistic automata
od: Kiefer, S, et al.
Izdano: (2011)

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

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

Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
od: Jovanovic, A, et al.
Izdano: (2017)

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

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

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

Revisiting the Equivalence Problem for Finite Multitape Automata
od: Worrell, J
Izdano: (2013)