In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive
systems in linear process format, into solving Parameterized Boolean Equation Systems. We prove correctness, and illustrate
the approach with an unbounded queue example. We also provide some adaptations to obtain similar transformations for weak
bisimulation and simulation equivalence.