On the Relationship between Reachability Problems in Timed and Counter Automata

On the Relationship between Reachability Problems in Timed and Counter Automata

Показать другие версии (1)

Библиографические подробности
Главные авторы:	Haase, C, Ouaknine, J, Worrell, J
Формат:	Journal article
Опубликовано:	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)

Reachability Problem for Weak Multi-Pushdown Automata
по: Wojciech Czerwiński, и др.
Опубликовано: (2013-09-01)

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)

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)

Language equivalence for probabilistic automata
по: Kiefer, S, и др.
Опубликовано: (2011)

On a reachability set of automaton counter machines
по: E. V. Kuzmin, и др.
Опубликовано: (2010-03-01)

Algebraic invariants for linear hybrid automata
по: Majumdar, R, и др.
Опубликовано: (2020)

Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata
по: Jovanovic, A, и др.
Опубликовано: (2017)

On a reachability set of automaton 3-counter machines
по: E. V. Kuzmin, и др.
Опубликовано: (2009-09-01)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
по: Kiefer, S, и др.
Опубликовано: (2013)

Revisiting the Equivalence Problem for Finite Multitape Automata
по: Worrell, J
Опубликовано: (2013)

Translating timed automata to tock-CSP
по: Khattri, M, и др.
Опубликовано: (2011)

Translating Timed Automata to Tock−CSP
по: Khattri, M, и др.
Опубликовано: (2011)