Checking strong/weak bisimulation equivalences and observation congruence for the π-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 707-718

  Li, Zhoujun ^a   Chen, Huowang ^a  

^a Changsha Institute of Technology   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

BISIMULATION CHECKING; BISIMULATION EQUIVALENCES; CORRECTNESS PROOFS; FINITE CONTROL; OBSERVATION CONGRUENCES; SYMBOLIC BISIMULATION; SYMBOLIC TRANSITION GRAPHS; VALUE PASSING PROCESS;

CALCULATIONS;

EID: 0012351526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055095     Document Type: Conference Paper

References (14)

1. M. Boreale and R. De Nicola. A symbolic semantics for the π-calculus. In CON-CUR'94, LNCS 836. Springer-Verlag, 1994.
2. R. Cleaveland, J. Parrow and B. Steffen. The concurrency workbench: A Semantics based verification tool for the verification of concurrent systems. ACM Transactions on Programming Language and Systems, Vol. 15, No. 1, 1993.
3. M. Dam. On the decidability of process equivalence for the π-calculus. Theoretical Computer Science, 183:214-228, 1997.
4. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353-389, 1995.
5. H. Lin. Symbolic bisimulations and proof systems for the π-calculus. Report 7/94, Computer Science, University of Sussex, 1994.
6. H. Lin. Complete inference systems for weak bisimulation equivalences in the π-calculus. In TAPSOFT'95. Spring-Verlag, 1995.
7. H. Lin. Symbolic transition graph with assignment. In CONCUR'96, LNCS 1119. Springer-Verlag, 1996.
8. Z.J. Li. Checking strong/weak bisimulation equivalences and observation congruence for value-passing processes and the π-calculus processes. Forthcoming Ph. D.thesis, Changsha Institute of Technology, 1998.
9. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
10. R. Milner. J. Parrow and D. Walker, A calculus of mobile processes, Part I, II. Information and Computation, 100:1-77, 1992.
11. U. Montanari and M. Pistore. Checking bisimilarity for finitary π-calculus. In CON-CUR'95, LNCS 962. Springer Verlag, 1995.
12. M. Pistore and D. Sangiorgi. A partition refinement algorithm for the π-calculus. In CAV'96, LNCS 1102. Spinger-Verlag, 1996.
13. D. Sangiorgi. A theory of bisimulation for the π-calculus. In CONCUR'93, LNCS 715. Springer-Verlag, 1993.
14. B. Victor and F. Moller. The mobility workbench-a tool for the π-calculus. In CAV'94, LNCS 818. Springer-Verlag, 1994.