An original notion of symmetry for process algebra is defined, which is based on permutation groups. Given a process which is regarded as a structure and a permutation group on it, the quotient process (reduced process) is showed to be interleaving trace equivalent and interleaving bisimulation equivalent to the original process. Furthermore, an algorithm and two examples for this symmetric reduction are presented.