ALGORITHM FOR VERIFYING STRONG OPEN BISIMULATION IN FULL

摘要

［1］Milner R, Parrow J, Walker D. A calculus of mobile processes[J]. Information and computation, 1992,100:1～77.［2］Milner R. Communication and Concurrency[M]. [s.l.]： Prentice Hall, 1989.［3］Pierce B, Sangiorgi D. Typing and subtyping for mobile processes[J]. Journal of Mathematical Structures in Computer Science, 1996,6(5):409～453.［4］Dam M. On the decidability of process equivalence for the π-calculus[J]. Theoretical Computer Science,1997,163:214～228.［5］Montanari U, Pistore M. Checking bismilarity for finitary π-calculus[A]. CONCUR'95[C]. Lecture Notes in Computer Science 962, Springer, 1995.42～56.［6］Victor B, Moller F. The mobility workbench--A tool for the π-calculus[A]. CAV'94[C]. Lecture Notes in Comuter Science 8188, Springer,1994.428～440.［7］李舟军.传值CCS和π-演算中互模拟等价的验证理论与算法[D].长沙：国防科技大学,1999.［8］Lin H. Symbolic transition graph with assignment[A]. CONCUR'96 [C], Lecture Notes in Computer Science 1119,Springer, 1996.50～65.［9］Boreale M, De Nicola R. A symbolic semantis for the π-calculus[J]. Information and Computation, 1996,126:34～52.［10］Pugh W, Bultan T, Gerber R. Symbolic model checking of infinite state systems using Presberger arithmetic [A].CAV'97[C]. Lecture Notes in Computer Science 1254, Springer, 1997.［11］Wolper P, Boigelot B. An automata-theoretic approach to Presburger arithmetic constraints[A]. Proceedings of Static Analysis Symposium[C]. Lecture in Computer Science 983, Springer, 1995.21～32.