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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς:	Abdulla, P, Deneux, J, Ouaknine, J, Quaas, K, Worrell, J
Μορφή:	Journal article
Γλώσσα:	English
Έκδοση:	2008

Παρόμοια τεκμήρια

Zone-based universality analysis for single-clock timed automata
ανά: Abdulla, P, κ.ά.
Έκδοση: (2007)

Decidability and complexity results for timed automata via channel machines
ανά: Abdulla, P, κ.ά.
Έκδοση: (2005)

Undecidability of universality for timed automata with minimal resources
ανά: Adams, S, κ.ά.
Έκδοση: (2007)

Undecidability of Universality for Timed Automata with Minimal Resources
ανά: Adams, S, κ.ά.
Έκδοση: (2007)

MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
ανά: Karin Quaas
Έκδοση: (2014-03-01)

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)

Reachability in Succinct and Parametric One−Counter Automata
ανά: Haase, C, κ.ά.
Έκδοση: (2009)

Reachability in Succinct and Parametric One-Counter Automata
ανά: Haase, C, κ.ά.
Έκδοση: (2009)

Model Checking Succinct and Parametric One-Counter Automata.
ανά: Göller, S, κ.ά.
Έκδοση: (2010)

Model Checking Succinct and Parametric One−Counter Automata
ανά: Göller, S, κ.ά.
Έκδοση: (2010)

Alternating Timed Automata over Bounded Time
ανά: Jenkins, M, κ.ά.
Έκδοση: (2010)

On the relationship between reachability problems in timed and counter automata
ανά: Haase, C, κ.ά.
Έκδοση: (2012)

On the Relationship between Reachability Problems in Timed and Counter Automata
ανά: Haase, C, κ.ά.
Έκδοση: (2012)

Alternating Timed Automata over Bounded Time
ανά: Jenkins, M, κ.ά.
Έκδοση: (2010)

On parametric timed automata and one-counter machines
ανά: Ouaknine, J, κ.ά.
Έκδοση: (2016)

Model checking flat freeze LTL on one-counter automata
ανά: Lechner, A, κ.ά.
Έκδοση: (2016)

Probabilistic Timed Automata with One Clock and Initialised Clock-Dependent Probabilities
ανά: Jeremy Sproston
Έκδοση: (2021-11-01)

On reachability for hybrid automata over bounded time
ανά: Brihaye, T, κ.ά.
Έκδοση: (2011)

Model Checking One-clock Priced Timed Automata
ανά: Patricia Bouyer, κ.ά.
Έκδοση: (2008-06-01)

Language equivalence for probabilistic automata
ανά: Kiefer, S, κ.ά.
Έκδοση: (2011)

Model Checking Probabilistic Timed Automata with One or Two Clocks
ανά: Marcin Jurdzinski, κ.ά.
Έκδοση: (2008-09-01)

Algebraic invariants for linear hybrid automata
ανά: Majumdar, R, κ.ά.
Έκδοση: (2020)

Model Checking Flat Freeze LTL on One-Counter Automata
ανά: Antonia Lechner, κ.ά.
Έκδοση: (2018-12-01)

On the Complexity of the Equivalence Problem for Probabilistic Automata
ανά: Kiefer, S, κ.ά.
Έκδοση: (2012)

ON THE COMPLEXITY OF EQUIVALENCE AND MINIMISATION FOR Q-WEIGHTED AUTOMATA
ανά: Kiefer, S, κ.ά.
Έκδοση: (2013)

Translating timed automata to tock-CSP
ανά: Khattri, M, κ.ά.
Έκδοση: (2011)

Translating Timed Automata to Tock−CSP
ανά: Khattri, M, κ.ά.
Έκδοση: (2011)

Avoiding Shared Clocks in Networks of Timed Automata
ανά: Sandie Balaguer, κ.ά.
Έκδοση: (2013-11-01)

On the Complexity of Equivalence and Minimisation for Q-weighted Automata
ανά: Stefan Kiefer, κ.ά.
Έκδοση: (2013-03-01)

Simulations for Event-Clock Automata
ανά: S Akshay, κ.ά.
Έκδοση: (2024-07-01)

Costs and rewards in priced timed automata
ανά: Fränzle, M, κ.ά.
Έκδοση: (2020)

Costs and rewards in priced timed automata
ανά: Fränzle, M, κ.ά.
Έκδοση: (2018)

Verification for Timed Automata extended with Unbounded Discrete Data Structures
ανά: Karin Quaas
Έκδοση: (2015-09-01)

Revisiting the Equivalence Problem for Finite Multitape Automata
ανά: Worrell, J
Έκδοση: (2013)

Towards a Theory of Time-Bounded Verification.
ανά: Ouaknine, J, κ.ά.
Έκδοση: (2010)

Clocks, Automata and the Mechanization of Nature (1300–1600)
ανά: Sylvain Roudaut
Έκδοση: (2022-12-01)

ASYNCHRONOUS VS VARIABLE CLOCK SYNCHRONOUS AUTOMATA
ανά: Nicolae GALUPA
Έκδοση: (2014-05-01)

Minimisation of multiplicity tree automata
ανά: Worrell, J, κ.ά.
Έκδοση: (2017)