Decidable and undecidable problems in schedulability analysis using timed automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2988, Issue , 2004, Pages 236-250

  Krčál, Pavel ^a   Yi, Wang ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY; TIME SHARING SYSTEMS;

ARRIVAL PATTERNS; COMPLETION TIME; COMPUTATION TASKS; REAL-TIME TASKS; SCHEDULABILITY; SCHEDULABILITY ANALYSIS; TECHNICAL CONTRIBUTION; TIMED AUTOMATA;

COMPUTABILITY AND DECIDABILITY;

EID: 35048885122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_20     Document Type: Article

References (19)

1. [Abd02] Y. Abdeddaïm. Scheduling with Timed Automata. PhD thesis, Verimag, 2002.
2. +95] R. Alur, G. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3-34, 1995.
3. [AD94] R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
4. +02] T. Amnell, E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi. Times a tool for modelling and implementation of embedded systems. In Proc. TAGAS'02, volume 2280 of LNCS, pages 460-464. Springer, 2002.
5. [AM01] Y. Abdeddaïm and O. Maler. Job-shop scheduling using timed automata. In Proc. CAV'01, volume 2102 of LNCS, pages 478-492. Springer, 2001.
6. [AM02] Y. Abdeddaïm and O. Maler. Preemptive job-shop scheduling using stopwatch automata. In Proc. TACAS'02, volume 2280 of LNCS, pages 113-126. Springer, 2002.
7. [CL00] F. Cassez and F. Laroussinie. Model-checking for hybrid systems by quotienting and constraints solving. In Proc. CAV'00, volume 1855 of LNCS, pages 373-388. Springer, 2000.
8. [Cor94] J. Corbett. Modeling and analysis of real-time ada tasking programs. In Proc. IEEE RTSS'94, pages 132-141, 1994.
9. [EWY98] C. Ericsson, A. Wall, and W. Yi. Timed automata as task models for event-driven systems. In Proceedings of Nordic Workshop on Programming Theory, 1998.
10. [Feh02] A. Fehnker. Citius, Vilius, Melius - Guiding and Cost-Optimality in Model Checking of Timed and Hybrid Systems. PhD thesis, KU Nijmegen, 2002.
11. [FMPY03] E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi. Schedulability analysis using two clocks. In Proc. TAGAS 2003, volume LNCS 2619, pages 224-239. Springer-Verlag, 2003.
12. [FPY02] E. Fersman, P. Pettersson, and W. Yi. Timed automata with asynchronous processes: Schedulability and decidability. In Proc. TACAS'02, volume 2280 of LNCS, pages 67-82. Springer, 2002.
13. [HHWT97] T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. HYTECH: A model checker for hybrid systems. International Journal on Software Tools for Technology Transfer, 1(1-2):123-133, 1997.
14. [HKPV98] T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57:94-124, 1998.
15. [HLP01] T. Hune, K.G. Larsen, and P. Pettersson. Guided Synthesis of Control Programs using UPPAAL. Nordic Journal of Computing, 8(1):43-64, 2001.
16. [LPY97] K.G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a Nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1-2):134-152, October 1997.
17. [MV94] J. McManis and P. Varaiya. Suspension automata: A decidable class of hybrid automata. In Proc. CAV'94, volume 818, pages 105-117. Springer, 1994.
18. [WH03] L. Waszniowski and Z. Hanzálek. Analysis of real time operating system based applications. In Proc. FORMATS'03, 2003.
19. [Yov97] S. Yovine. Kronos: A verification tool for real-time systems. International Journal on Software Tools for Technology Transfer, 1(1-2):110-122, 1997.