Confluence for Process Verification

We provide several notions for confluence in processes and we show how these relate to τ-inertness, i.e. if then s and s′ are equivalent. Using clustered linear processes we show how these notions can conveniently be used to reduce the size of state spaces and simplify the structure of processes while preserving equivalence.