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)

Xehetasun bibliografikoak
Egile Nagusiak:	Haase, C, Ouaknine, J, Worrell, J
Formatua:	Journal article
Argitaratua:	2012

Antzeko izenburuak

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

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

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

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

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

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

Revisiting reachability in timed automata
nork: Quaas, K, et al.
Argitaratua: (2017)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Reachability in pushdown register automata
nork: Murawski, A, et al.
Argitaratua: (2017)

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

On the complexity of model checking counter automata
nork: Haase, C
Argitaratua: (2012)

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

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

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

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

Language equivalence for probabilistic automata
nork: Kiefer, S, et al.
Argitaratua: (2011)

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

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

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

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

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

Revisiting the Equivalence Problem for Finite Multitape Automata
nork: Worrell, J
Argitaratua: (2013)

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

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