Combining "forcing" and "global" idea, Xu et al. proposed the concepts: complete forcing set and complete forcing number of perfect matchings of graph. In this paper, we give explicit formulae for the complete forcing numbers of phenylene chains and catacondensed phenylene systems, respectively. Moreover, we present an algorithm to find the minimum complete forcing sets of these graphs.