66 ;;Quote: hard real-time requires constant-bounded loops per task activation; allows schedulability analysis

67 ;;Quote: Real-Time Euclid requires timing constraints for programs, a real-time process model, and bounded-time constructs

67+;;Quote: Real-Time Euclid is the first language to provide schedulability analysis

67 ;;Quote: each process is Real-Time Euclid has a frame; once activated, it must complete before the end of the frame; no reactivation in frame

68 ;;Quote: HI-Pearl lets you specify synchronization times for tasks and resources; system schedules times slots and checks for inconsistencies

71 ;;Quote: in HI-Pearl, can handle overload by degrading system performance with alternate task bodies; e.g., use extrapolation

72 ;;Quote: multi-version coding can compare imprecise results with precise ones