A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The theory of timed automata provides a formal framework to model and to verify the correct functioning of real-time systems. Among the di erent v eri cation problems that have been investigated within this theory, the so-called reachability problem has been the most throughly studied. This problem is stated as follows. Given two s t a t e s o f the system, is there an execution starting at one of them that reaches the other? The rst reason for studying such problem is that safety propertiesdoi:10.1007/3-540-65193-4_20 fatcat:mggztnumd5glbgcpl25qkle7qi