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...
Main Authors: | 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, et al.
出版: (2007) -
Decidability and complexity results for timed automata via channel machines
由: Abdulla, P, et al.
出版: (2005) -
Undecidability of universality for timed automata with minimal resources
由: Adams, S, et al.
出版: (2007) -
Undecidability of Universality for Timed Automata with Minimal Resources
由: Adams, S, et al.
出版: (2007) -
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
由: Karin Quaas
出版: (2014-03-01)