Real-Time Euclid(ID:1263/rea005)Euclid with RT extensionsRelated languages
References: in IEEE Trans Soft Eng 11(01) January 1995 view details RealTime Euclid is a language extended from Euclid with realtime 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 realtime software as predictable as possible since it is impossible to analyze the schedulability without taking into account the actual system configuration and runtime 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 RealTime 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, RealTime 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 devicecondition variables, as well as exception handlers, are all timebounded. in IEEE Trans Soft Eng 11(01) January 1995 view details |