Checking strong open congruence in χ-calculus

The χ-calculus is an important evolution for mobile process calculi. Open congruence is widely studied in χ-calculus. However, there still lacks an algorithm for checking this bisimulation relation. In this paper, the symbolic technique is applied to the research of χ-calculus and an efficient characterization for strong open congruence which does not involve quantification over substitutions is given. Based on it, an algorithm, which instantiates bound names 'on-the-fly', is developed to check strong open congruence for finite control processes