Analysis of real time operating system based applications

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

Volumn 2791, Issue , 2004, Pages 219-233

  Waszniowski, Libor ^a   Hanzalek, Zdenek ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER OPERATING SYSTEMS; MODEL CHECKING; TIME SHARING SYSTEMS;

APPLICATION PROCESS; COMPUTATION TIME; COOPERATIVE SCHEDULING; INTERRUPT SERVICE ROUTINE; MULTITASKING OPERATING SYSTEMS; REACHABILITY PROBLEM; REAL TIME OPERATING SYSTEM; REAL-TIME APPLICATION;

REAL TIME SYSTEMS;

EID: 35048845102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_18     Document Type: Article

References (13)

1. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126:183-235, 1994.
2. David, A.: Uppaal2k: Small Tutorial. Documentation to the verification tool Uppaal2k. http://www.docs.uu.se/docs/rtmv/uppaal/
3. Buttazzo, G., C.: Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, Boston (1997)
4. Sha, L., Klein, M., Goodenough, J.: Rate Monotonic Analysis for Real-Time Systems. 129-155. Foundations of Real-Time Computing: Scheduling and Resource Management. Boston, MA: Kluwer Academic Publishers (1991)
5. Graham, R.L.: Bounds on multiprocessing timing anomalies. SLAM Journal on Applied Mathematics, Vol. 17, pp. 416-429, 1969
6. Larsen, K.G., Pettersson, P., Yi, W.: Model-Checking for Real-Time Systems. In Proceedings of the 10th International Conference on Fundamentals of Computation Theory, Dresden, Germany, 22-25 August, 1995. LNCS 965, pages 62-88, Horst Reichel (Ed.)
7. Liu, J.W.S.: Real-time systems. Prentice-Hall, Inc., Upper Saddle River, New Jersey 2000. ISBN 0-13-099651-3
8. Shaw, A.: Reasoning about time in higher-level language software. IEEE Transactions on Software Engineering, vol. 15, July 1989
9. Corbett, J. C.: Timing analysis of Ada tasking programs. IEEE Transactions on Software Engineering. 22(7), pp. 461-483, July 1996
10. Cassez F., Larsen K.: The Impressive Power of Stopwatches. In Proceedings of CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 2000 CONCUR'2000. LNCS 1877, p. 138 ff, 2000
11. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What's decidable about hybrid automata? Journal of Computer and System Sciences 57:94-124, 1998
12. Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Are Timed Automata Updatable?. In Proc. 12th Int. Conf. Computer Aided Verification (CAV'00), LNCS, Vol.1855, pp. 464-479, Springer (2000)
13. Fersman, E., Pettersson, P., Yi, W.: Timed Automata with Asynchronous Processes: Schedulability and Decidability. In Proceedings of 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2002, Grenoble, France, April 8-12, 2002, pp.67-82, Springer-Verlag, 2002. Lecture Notes in Computer Science, Vol.2280