Undecidability of universality for timed automata with minimal resources
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...
| Hauptverfasser: | , , |
|---|---|
| Format: | Journal article |
| Sprache: | English |
| Veröffentlicht: |
2007
|