Real-Time Euclid(ID:1263/rea005)

Euclid with RT extensions 

Related languages
Euclid => Real-Time Euclid   Augmentation of
Real-Time Euclid => PEARL 90   Incorporated some features of

  • Stoyenko, A. D. "A schedulability analyzer for real-time Euclid" in Proc. of 8th Real-Time Systems Symp., pages 218--227, San Jose, Calif., December 1987. view details
  • Stoyenko, Alexander D. "Real-Time Euclid: Concepts Useful for the Further Development of PEARL" Proceedings of the Workshop über Realzeitsysteme, 11. Fachtagung des PEARL-Vereins e.V. unter Mitwirkung von GI und GMA November 1990 view details
  • Almes, G. et al, "The Eden System: A Technical Review" view details
          in IEEE Trans Soft Eng 11(01) January 1995 view details
  • Kwei-Jay Lin. Issues on Real-Time Systems Programming: Language, Compiler, and Object Orientation. in Sang H. Son, editor, Advances in Real-Time Systems, chapter 14. Prentice Hall, 1995 view details Extract: Real-Time Euclid
    Real­Time Euclid is a language extended from Euclid with real­time constructs and with provisions for ``schedulability analysis,'' i.e. to verify that software adheres to its timing constraints at compile time. The effort, in fact, is to make real­time software as predictable as possible since it is impossible to analyze the schedulability without taking into account the actual system configuration and run­time support (like OS support, scheduling model, network protocol, etc.). In other words, some part of the schedulability analysis may need to be performed outside the compile time. In Real­Time Euclid, timing constraints are defined by the frames associated with processes. Each process must complete its task before the end of the current frame, and cannot be reactivated until the end of the current frame. To be able to verify that software can meet its timing constraints, Real­Time Euclid has no constructs that can take arbitrarily long to execute. For example, loops must have constant counts. No recursion and dynamic variables are allowed. Wait­ and device­condition variables, as well as exception handlers, are all time­bounded.

          in IEEE Trans Soft Eng 11(01) January 1995 view details