Computing strong/weak bisimulation equivalences and observation congruence for value-passing processes

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

Volumn 1579, Issue , 1999, Pages 300-314

  Li, Zhoujun ^a   Chen, Huowang ^a  

^a Changsha Institute of Technology   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEMANTICS;

BISIMULATION EQUIVALENCES; OBSERVATION CONGRUENCES; OPERATIONAL SEMANTICS; STRONG BISIMULATION; SYMBOLIC TRANSITION GRAPHS; VALUE PASSING PROCESS; WEAK BISIMULATION;

GRAPHIC METHODS;

EID: 84948976914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49059-0_21     Document Type: Conference Paper

References (12)

1. G. Bruns. Distributed System Analysis with CCS. Prentice Hall, 1996.
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, pages 36-72, 1993.
3. J. Godskesen, K. Larsen and M. Zeeberg. Tav user manual. Report R89-19, Aalborg University, 1989.
4. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138: 353-389, 1995.
5. M. Hennessy and H. Lin. Proof systems for message-passing process algebras. Formal Aspects of Computing, No 3, 1996.
6. B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and computation, 107: 272-302, 1993.
7. K. G. Larsen. Efficient local correctness checking. In CAV'92, LNCS. Springer-Verlag, 1992.
8. Z. J. Li. Checking weak bisimulation equivalence and observation congruence for value-passing processes with finite symbolic transiton graphs. Technical report 6/97, Changsha Institute of Technology, 1997.
9. Z. J. Li and H. W. Chen. Checking strong/weak bisimulation equivalences and obser-vation congruence for the α-calculus. In ICALP'98, LNCS 1443. Springer-Verlag, 1998.
10. H. Lin. Symbolic transition graph with assignment. In CONCUR'96, LNCS 1119. Springer-Verlag, 1996.
11. X. Liu. Specification and decomposition in concurrency. Ph. D. thesis, Aalborg Uni-versity, 1992.
12. R. MiIner. Communication and Concurrency. Prentice-Hall, 1989.