We extend the theory of partial order methods with a new notion of $tau$-confluence. Based on this new notion we define a reduced transition system, which is branching bisimilar to the original state space. We show that the new notion is preserved under various transformations. We present an algorithm which efficiently computes the reduced transition system from a symbolic representation.

Software Engineering [SEN]
Specification and Analysis of Embedded Systems

Blom, S.C.C. (2001). Partial $ au$-confluence for efficient state space generation. Software Engineering [SEN]. CWI.