On the relationship between reachability problems in timed and counter automata

On the relationship between reachability problems in timed and counter automata

Бусад хувилбаруудыг харуулах (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...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид:	Haase, C, Ouaknine, J, Worrell, J
Формат:	Journal article
Хэл сонгох:	English
Хэвлэсэн:	2012

Ижил төстэй зүйлс

On the Relationship between Reachability Problems in Timed and Counter Automata
-н: Haase, C, зэрэг
Хэвлэсэн: (2012)

Reachability in Succinct and Parametric One−Counter Automata
-н: Haase, C, зэрэг
Хэвлэсэн: (2009)

Reachability in Succinct and Parametric One-Counter Automata
-н: Haase, C, зэрэг
Хэвлэсэн: (2009)

On reachability for hybrid automata over bounded time
-н: Brihaye, T, зэрэг
Хэвлэсэн: (2011)

Branching-time model checking of parametric one-counter automata
-н: Göller, S, зэрэг
Хэвлэсэн: (2012)

Branching−Time Model Checking of Parametric One−Counter Automata
-н: Göller, S, зэрэг
Хэвлэсэн: (2012)

Revisiting reachability in timed automata
-н: Quaas, K, зэрэг
Хэвлэсэн: (2017)

Model Checking Succinct and Parametric One-Counter Automata.
-н: Göller, S, зэрэг
Хэвлэсэн: (2010)

Model Checking Succinct and Parametric One−Counter Automata
-н: Göller, S, зэрэг
Хэвлэсэн: (2010)

On reachability problems for low-dimensional matrix semigroups
-н: Colcombet, T, зэрэг
Хэвлэсэн: (2019)

On parametric timed automata and one-counter machines
-н: Ouaknine, J, зэрэг
Хэвлэсэн: (2016)

Reachability−Time Games on Timed Automata
-н: Jurdzinski, M, зэрэг
Хэвлэсэн: (2007)

Model checking flat freeze LTL on one-counter automata
-н: Lechner, A, зэрэг
Хэвлэсэн: (2016)

On the decidability of reachability in linear time-invariant systems
-н: Fijalkow, N, зэрэг
Хэвлэсэн: (2019)

Reachability and liveness in parametric timed automata
-н: Étienne André, зэрэг
Хэвлэсэн: (2022-02-01)

The pseudo-reachability problem for diagonalisable linear dynamical systems
-н: D'Costa, J, зэрэг
Хэвлэсэн: (2022)

On recurrent reachability for continuous linear dynamical systems
-н: Ouaknine, J, зэрэг
Хэвлэсэн: (2016)

On recurrent reachability for continuous linear dynamical systems
-н: Chonev, V, зэрэг
Хэвлэсэн: (2016)

Model Checking Flat Freeze LTL on One-Counter Automata
-н: Antonia Lechner, зэрэг
Хэвлэсэн: (2018-12-01)

Undecidability of universality for timed automata with minimal resources
-н: Adams, S, зэрэг
Хэвлэсэн: (2007)

Undecidability of Universality for Timed Automata with Minimal Resources
-н: Adams, S, зэрэг
Хэвлэсэн: (2007)

Reachability Problem for Weak Multi-Pushdown Automata
-н: Wojciech Czerwiński, зэрэг
Хэвлэсэн: (2013-09-01)

Alternating Timed Automata over Bounded Time
-н: Jenkins, M, зэрэг
Хэвлэсэн: (2010)

On the Complexity of the Equivalence Problem for Probabilistic Automata
-н: Kiefer, S, зэрэг
Хэвлэсэн: (2012)

Reachability in pushdown register automata
-н: Murawski, A, зэрэг
Хэвлэсэн: (2017)

Alternating Timed Automata over Bounded Time
-н: Jenkins, M, зэрэг
Хэвлэсэн: (2010)

On the complexity of model checking counter automata
-н: Haase, C
Хэвлэсэн: (2012)

COMPLETELY REACHABLE ALMOST GROUP AUTOMATA
-н: David Fernando Casas Torres
Хэвлэсэн: (2024-12-01)

Universality Analysis for One-Clock Timed Automata
-н: Abdulla, P, зэрэг
Хэвлэсэн: (2008)

Decidability and complexity results for timed automata via channel machines
-н: Abdulla, P, зэрэг
Хэвлэсэн: (2005)

Zone-based universality analysis for single-clock timed automata
-н: Abdulla, P, зэрэг
Хэвлэсэн: (2007)

Improved Undecidability Results for Reachability Games on Recursive Timed Automata
-н: Shankara Narayanan Krishna, зэрэг
Хэвлэсэн: (2014-08-01)

Language equivalence for probabilistic automata
-н: Kiefer, S, зэрэг
Хэвлэсэн: (2011)

Algebraic invariants for linear hybrid automata
-н: Majumdar, R, зэрэг
Хэвлэсэн: (2020)

On a reachability set of automaton counter machines
-н: E. V. Kuzmin, зэрэг
Хэвлэсэн: (2010-03-01)

Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
-н: Jovanovic, A, зэрэг
Хэвлэсэн: (2017)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
-н: Kiefer, S, зэрэг
Хэвлэсэн: (2013)

On a reachability set of automaton 3-counter machines
-н: E. V. Kuzmin, зэрэг
Хэвлэсэн: (2009-09-01)

Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs
-н: Rayna Dimitrova, зэрэг
Хэвлэсэн: (2015-09-01)

Revisiting the Equivalence Problem for Finite Multitape Automata
-н: Worrell, J
Хэвлэсэн: (2013)