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)

Manylion Llyfryddiaeth
Prif Awduron:	Haase, C, Ouaknine, J, Worrell, J
Fformat:	Journal article
Cyhoeddwyd:	2012

Eitemau Tebyg

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

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

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

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

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

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

Revisiting reachability in timed automata
gan: Quaas, K, et al.
Cyhoeddwyd: (2017)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Reachability in pushdown register automata
gan: Murawski, A, et al.
Cyhoeddwyd: (2017)

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

On the complexity of model checking counter automata
gan: Haase, C
Cyhoeddwyd: (2012)

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

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

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

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

Language equivalence for probabilistic automata
gan: Kiefer, S, et al.
Cyhoeddwyd: (2011)

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

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

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

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

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

Revisiting the Equivalence Problem for Finite Multitape Automata
gan: Worrell, J
Cyhoeddwyd: (2013)

Translating timed automata to tock-CSP
gan: Khattri, M, et al.
Cyhoeddwyd: (2011)

Translating Timed Automata to Tock−CSP
gan: Khattri, M, et al.
Cyhoeddwyd: (2011)