Quantitative Analysis of Real-Time Systems Using Priced Timed Automata
Larsen, Kim G.
- Publisher: ASSOC COMPUTING MACHINERY
COMMUNICATIONS OF THE ACM
[ INFO ] Computer Science [cs] | [ INFO.INFO-FL ] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
International audience; The problems of time-dependent behavior in general, and dynamic resource allocation in particular, pervade many aspects of modern life. Prominent examples range from reliability and efficient use of communication resources in a telecommunication network to the allocation of tracks in a continental railway network, from scheduling the usage of computational resources on a chip for durations of nanoseconds to the weekly, monthly or longer-range reactive planning in a factory or a supply chain. These problems have been subject to substantial research for decades by different communities such as operational research, computer systems performance evaluation as well as planning and scheduling, witnessed by large ACM communities such as SIGMETRICS and PERFORMANCE. In this paper we argue that the formalism of timed automata together with recent extensions provides an alternative framework with complementary, yet competitive, results in terms of modeling ca-pabilities and efficiency of analysis.