Universality Analysis for One-Clock Timed Automata

Universality Analysis for One-Clock Timed Automata

This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality problem is undecidable if A has two clocks, but they left open the status of the problem when A has a single clock. In th...

Descripció completa

Dades bibliogràfiques
Autors principals:	Abdulla, P, Deneux, J, Ouaknine, J, Quaas, K, Worrell, J
Format:	Journal article
Idioma:	English
Publicat:	2008

Ítems similars

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

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

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

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

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

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)

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

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)

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)

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)

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

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

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
per: Jeremy Sproston
Publicat: (2021-11-01)

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

Model Checking One-clock Priced Timed Automata
per: Patricia Bouyer, et al.
Publicat: (2008-06-01)

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

Model Checking Probabilistic Timed Automata with One or Two Clocks
per: Marcin Jurdzinski, et al.
Publicat: (2008-09-01)

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

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

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)

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)

Avoiding Shared Clocks in Networks of Timed Automata
per: Sandie Balaguer, et al.
Publicat: (2013-11-01)

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

Simulations for Event-Clock Automata
per: S Akshay, et al.
Publicat: (2024-07-01)

Costs and rewards in priced timed automata
per: Fränzle, M, et al.
Publicat: (2020)

Costs and rewards in priced timed automata
per: Fränzle, M, et al.
Publicat: (2018)

Verification for Timed Automata extended with Unbounded Discrete Data Structures
per: Karin Quaas
Publicat: (2015-09-01)

Revisiting the Equivalence Problem for Finite Multitape Automata
per: Worrell, J
Publicat: (2013)

Towards a Theory of Time-Bounded Verification.
per: Ouaknine, J, et al.
Publicat: (2010)

Clocks, Automata and the Mechanization of Nature (1300–1600)
per: Sylvain Roudaut
Publicat: (2022-12-01)

ASYNCHRONOUS VS VARIABLE CLOCK SYNCHRONOUS AUTOMATA
per: Nicolae GALUPA
Publicat: (2014-05-01)

Minimisation of multiplicity tree automata
per: Worrell, J, et al.
Publicat: (2017)