Context-Sensitive Middleware-Based Applications B

### Program Information

Name: Context-Sensitive Middleware-Based Applications B
Domain: Algorithm
Functionality: A example of a smart delivery system of a supermarket chain such that individual suppliers replenish their products onto pallets, shelves, and cases in various warehouses according to the demand sent off by such pallets.  The smart deliver system includes four features: (1)Each smart pallet can be dynamically configured to store a particular kind of product at, as far as possible, a desired quantity level.   (2)Each van of a supplier delivers a type of goods. (3)Goods that cannot sell can be returned to the supplier. A smart pallet may request a van to retract certain amount of goods. (4)The system assumes that the effective delivery distance for any pallet by any van is at most 25 meters
Input: define $\varepsilon = 5$;  $q_v$ is the quantity of goods deliverable by a van;  $p_v$ is the location of the van in $(x, y)$ coordinates;  $d$ is square of distance between the van and a pallet;  $s$ is no. of vans surrounding the pallet;  $q_d$ is the desired quantity of goods for the pallet;  $q_l$ is the ledger amount of goods in the pallet;  $q_p$ is the quantity of goods on hand in the pallet;  $p_p$ is the location of the pallet in $(x, y)$ coordinates;  $q_l=\sum_{i=1}^s q_v^{(i)}+q_p$ where $q_v^{(i)}$ denotes the context variable $q_v$ from the $i$th surrounding van.
Output:

#### Reference

 A Metamorphic Approach to Integration Testing of Context-Sensitive Middleware-Based Applications https://doi.org/10.1109/QSIC.2005.3

### MR Information

#### MR1------

Description:
Property: If $q_{d_1}=q_{d_2},d_1 \leq 625$,and $d_2 \leq 625$ then $q_{l_1} \approx q_{l_2}$
Source input:
Source output:
Follow-up input:
Follow-up output:
Input relation:
Output relation:
Pattern:

#### MR2------

Description:
Property: Let t be an original test case and $t'$ be a follow-up test case that share the same checkpoint, known as an initial checkpoint. If we apply Withdraw() to the initial checkpoint before executing $t'$ , the number of invocations of the Replenish() function for $t'$ is expected to be more than that of $t$. If we apply Replenish() to the initial checkpoint before executing $t'$ , the number of invocations of the Withdraw() function for $t'$ is expected to more be than that of t.
Source input:
Source output:
Follow-up input:
Follow-up output:
Input relation:
Output relation:
Pattern:
Insert title here