A skewed-load transition test is a delay test where the second vector of the delay test pair is a one bit shift over the first vector in the pair. This situation occurs in principle when testing the combinational logic residing between scan chains. In the skewedload test protocol, in order not to disturb the logic initialized by the first vector of the delay test pair, the second vector of the pair (the one that launches the transition) is required to be the next (i.e. one bit-shift) pattern in the scan chain. This paper describes a calculus that allows one to compute the complete set of skewed-load transition test vectors. The calculus is capable of simultaneously computing both the first and second vector of the delay test pair. Probabilistic analysis of random pattern skewedload-based transition test is also discussed in this paper. We show how to extend both the Parker-McCluskey algorithm and the cutting algorithm to compute detection probability of transition faults.