We extend the form of this notion which is based on designs to capture probabilistic requirements on execution time.
This approach includes the elicitation of the organization's requirements for execution views, the initial definition and validation of a set of execution viewpoints, and the documentation of the execution viewpoints.
The second formalism provides the minimum energy requirement for execution of a QCA architecture.
The relational database also integrates the requirements of a manufacturing execution system within the multi-agent task structure, which is unique to this architecture.
We abstract away what a distributed computation does and represent it by the using what sequence of its resource requirements for each step of execution.
Specifically, by repeating this list (possibly ad infinitum), a periodic sequence of execution requirements is generated such that the execution time of each frame is bounded from above by the corresponding value in the periodic sequence.
The multiframe task model (as presented by Mok and Chen [17] and later generalized by Baruah et al. [18]) allows system designers to model a task by using a static and finite list of execution requirements, corresponding to successive jobs (or frames as they are named in this model).
For instance, the manager may need to increase the rate of failure detection or coverage of requirements by scheduling execution of test cases in an order in which the first test cases reveal as more failures as possible or cover as more requirements as possible.
Due to these strong requirements, the execution of RDE measurements has to be preceded by an accurate planning of the route to reduce test failure risk and, consequently, experimental costs.
The total execution requirement of task τ i, denoted by C i, is the sum of the execution requirements of all the sub-tasks in S i, i.e., (C_{i} stackrel {text {def}} sum _{k=1}^{n_{i}} sum _{q=1}^{v_{k}} e^{q}_{s_{i}^{k}}).
