Modeling and reasoning timing constraints in open distributed real-time and embedded systems
Shangping Ren, Yue Yu · 2009
Open, distributed, real-time, and embedded (ODRE) applications often involve different types of timing constraints and face trade-offs between timeliness and other resource consumptions. These systems' safety-depends not only on the correctness of delivered computation but also on the satisfaction of specified timing constraints. That is, any design effort for optimizing sparse resource consumption for embedded applications must not compromise the satisfaction of timing constraints. Therefore, understanding the semantics of a given set of constraints and its satisfaction feasibility is critical in developing robust ODRE systems. Motivated by previous work in the areas of modeling and monitoring of timing constraints, optimizing quality of service under resource constraints, and coordination models and languages for ODRE systems, our results extend existing theories on timing constraint modeling and analysis to be applicable to more realistic ODRE systems. We propose metrics to quantify timing constraint satisfactions which are utilized to guide the designs of such systems. We also provide algebraic abstractions of different timing constraint types to facilitate specifications and verifications of ODRE systems.