Theoretical Computer Science
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
Hi-index | 0.00 |
A preparation of the consistent task schedule is significant for the proper functioning of reminder systems. Two problems have to be solved thereby: avoiding temporal task overlapping; preventing task generation with an unlimited task execution time. Each task consists of complex activities combining temporally linked actions. The article introduces a method for formal description of such activities. To limit the execution time of the activities, definitions of timer transitions were included in the action specification. The expiration of the timer causes a transition to a specified action. The fact that the actual timer depends on the actions performed before complicates the analysis. A timed automaton can be built for each complex activity based on the introduced description. This automaton is applied to quantitative and qualitative analysis of temporal aspects of the activities. The article presents an algorithm for calculating the duration limits of the activities and for detecting the unlimited activities.