Covering Problems on Permutations

Sequence covering arrays are a mathematical object employed in many software testing schemes as they allow for sequences of events of a fixed length to be tested at least once each. A recently introduced variant called the perfect sequence covering array imposes that each sequence be covered the same number of times. In this thesis, we address problems concerning these objects, including finding minimal examples of perfect sequence covering arrays and presenting a general method of construction for perfect sequence covering arrays.