Undecidability of Universality for Timed Automata with Minimal Resources

Conference item

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 timed automaton accept every timed word? As a result, much research has focussed on attempting to circumvent this difficulty, often by restricting the class of automata under consideration, or by ...

Expand abstract

Authors: Adams, S; Ouaknine, J; Worrell, J

• Publisher: Springer
• Host title: Formal Modeling and Analysis of Timed Systems 2007
• Volume: 4763
• Publication date: 2007-01-01
• ISBN: 9783540754534