We address the problem of
minimizing labelled transition systems for name passing calculi.
We show how the co-algebraic formulation of
automata with naming directly suggests an effective minimization
algorithm which reduces the number of states to be analyzed in
the verification of properties for name passing process calculi.
