Undecidability of universality for timed automata with minimal resources

Undecidability of universality for timed automata with minimal resources

Veure altres versions (1)

Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the algorithmic analysis of timed automata, however, results from the undecidability of the universality problem: does a given...

Descripció completa

Dades bibliogràfiques
Autors principals:	Adams, S, Ouaknine, J, Worrell, J
Format:	Journal article
Idioma:	English
Publicat:	2007

Ítems similars

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

On the Undecidability of Universality for Timed Automata with Minimal Resources
per: Adams, S
Publicat: (2006)

On undecidability of equicontinuity classification for cellular automata
per: Bruno Durand, et al.
Publicat: (2003-01-01)

Two Undecidability Results in Probabilistic Automata Theory
per: Kilian, Joseph J.
Publicat: (2023)

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

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

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

Two undecidability results in probabilistic automata theory
per: Kilian, Joe.
Publicat: (2020)

MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
per: Karin Quaas
Publicat: (2014-03-01)

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

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

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

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

The language preservation problem is undecidable for parametric event-recording automata
per: André, Étienne, et al.
Publicat: (2020)

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

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

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

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

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

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

Language equivalence for probabilistic automata
per: Kiefer, S, et al.
Publicat: (2011)

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

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

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

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

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

Unsimulability, Universality, and Undecidability in the Gizmo Framework
per: Ani, Joshua
Publicat: (2023)

Undecidability in number theory
per: Koenigsmann, J
Publicat: (2013)

O-minimal invariants for discrete-time dynamical systems
per: Almagor, S, et al.
Publicat: (2022)

Undecidability in algebra
per: Ng, Kieran Elodie
Publicat: (2024)

Heuristics for the Undecidable
per: Tom Scholte
Publicat: (2019-01-01)

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

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

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

SOLVING DIFFERENCE EQUATIONS IN SEQUENCES: UNIVERSALITY AND UNDECIDABILITY
per: GLEB POGUDIN, et al.
Publicat: (2020-01-01)

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

Revisiting reachability in timed automata
per: Quaas, K, et al.
Publicat: (2017)

The undecidable : basic papers on undecidable propositions, unsolvable problems and computable functions /
per: 429964 Davis, Martin
Publicat: (1965)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
per: Stefan Kiefer, et al.
Publicat: (2013-03-01)

The undecidability in the Other AI
per: Michael K C Thanga
Publicat: (2024-10-01)