Symbolic transition graph and its early bisimulation checking algorithms for the π-calculus

Milner, R., Parrow, J., Walker, D., A calculus of mobile processes, Part I, II,Information and Computation, 1992, 100: 1.

Milner, R.,Communication and Concurrency, New York: Prentice-Hall, 1989.

Dam, M., On the decidability of process equivalence for the π-calculus,Theoretical Computer Science, 1997, 183: 214.

Montanari, U., Pistore, M., Checking bisimilarity for finitary π-calculus, inCONCUR'95, LNCS962 Berlin: Springer-Verlag, 1995, 42–56.

Pistore, M., Sangiorgi, D., A partition refinement algorithm for the π-calculus, inCAV'96, LNCS1102 Berlin: Springer-Verlag, 1996, 38–49.

Victor, B., Moller, F., The mobility workbench—a tool for the π-calculus, inCAV'94, LNCS 818 Berlin: Springer-Verlag, 1994.

Hennessy, M., Lin, H., Symbolic bisimulations,Theoretical Computer Science, 1995, 138.: 353.

Lin, H., Symbolic transition graph with assignment, inCONCUR'96, LNCS 1119, Berlin: Springer-Verlag, 1996.

Boreale, M., De Nicola, R., A symbolic semantics for the π-calculus, inCONCUR'94, LNCS 836, Berlin: Springer-Verlag, 1994.

Lin, H., Complete inference systems for weak bisimulation equivalences in the π-calculus, inTAPSOFT'95, LNCS 915, Berlin: Springer-Verlag, 1995, 187–201.

Cleaveland, R., Parrow, J., Steffen, B., The concurrency workbench: a semantics based verification tool for the verification of concurrent systems,ACM Transactions on Programming Language and Systems, 1993, 15(1): 36.