WeaklyHardDistribution : public class
Created: |
2012-05-28 13:23:34 |
Modified: |
2012-07-10 16:38:46 |
|
Project: |
|
Author: |
yt30282 |
Version: |
1.0 |
Phase: |
1.0 |
Status: |
Proposed |
Complexity: |
Easy |
Advanced: |
|
UUID: |
{716D52DB-A753-4948-AA72-EB8BEB071E7D} |
Appears In: |
TimeDistribution |
<p>The timing constraints defined in TADL2 are strongly-hard in the sense that they must hold for each occurrence of some designated event. For example, the DelayConstraint requires that for each occurrence of the source event, there is at least one occurrence of the target event within a fixed interval relative to the source. It only takes one absent response occurrence to render the whole DelayConstraint violated.<br/></p><p><br/></p><p>In many situations, a system may in fact work correctly even if a strongly-hard constraint is not satisfied for a bounded number of occurrences. Therefore, TADL2 generalizes the concept of weakly-hard constraints (which was originally introduced for describing allowed deadline misses) to formalize scenarios in which a bounded number of occurrences are allowed to violate the constraint requirements.<br/></p><p><br/></p><p>Semantics:<br/></p><p>The semantics of a weakly-hard expression (m, k) is that the behavior must satisfy the given constraint at least m times out of k consecutive occurrences.<br/></p>
Attribute |
Details |
public Integer k |
|
public Integer m |
|