Monitoring Timing Constraints with Real-time Logic
基于实时逻辑的时间约束检测方法

Three klnds of methods, which make use of real-time logic to realize monitoring timing constraints, are discussed and analyzed in this paper with respect to the restrict thoe requirement systems. The first kind of method is to prove the satisfiability for constraints by monitoring the consistency of the system specifications and safety asser- tions. It is very suitable for designing system specifications and detecting satisfiability. And the complexity of algo- rithm is O(n~2)+O(n~2)+O(2~k). The second kind of method utilizes real-time lgic and constraints graphs realizing run- time constraints monitoring, but constraints in monitoring are not as simple as the third one's. And the complexity of algorithm is O(n~3),after being improved it turns to be O(n~2). The third kind of method reduces the constraints during the run-time monitoring, by dealing with the constraints graphs first. As a result it reduces the thae of searching time-constraints in run-time. And the complexity of algorithm is O(n). Obviously it is superior to the first two kinds of methods in real-time character and efficiency of measuring. However optimizing the constraints before run-time would add extra time and space complexity.