# Bisimulation Lattice of Chi Processes

## Abstract

Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-bisimilarity is introduced to give a possible classification of bisimilarities on chi processes. It is shown that the set of L-bisimilarities forms a four element lattice and that well-known bisimilarities for chi processes fit into the lattice hierarchy. The four distinct L-bisimilarities give rise to four congruence relations. Complete axiomatization system is given for each of the four relations. The bisimulation lattice of asynchronous chi processes and that of asymmetric chi processes are also investigated. It turns out that the former consists of two elements while the latter twelve elements. Finally it is pointed out that the asynchronous asymmetric chi calculus has a bisimulation lattice of eight elements

## Keywords

Normal Form Operational Semantic Congruence Relation Label Transition System Process Algebra## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Amadio, R., Castellani, I., Sangiorgi, D.: On Bisimulation for the Asynchronous π-Calculus. CONCUR’96, Lecture Notes in Computer Science 1119 (1996)Google Scholar
- 2.Boudol, G.: Asynchrony and the χ-Calculus. Research Report 1702, INRIA, Sophia-Antipolis (1992)Google Scholar
- 3.Fu, Y.: The χ-Calculus. Proceedings of the International Conference on Advances in Parallel and Distributed Computing, March 19th–21th, Shanghai, IEEE Computer Society Press (1997) 74–81Google Scholar
- 4.Fu, Y.: A Proof Theoretical Approach to Communications. ICALP’97, July 7th–11th, Bologna, Italy, Lecture Notes in Computer Science 1256 (1997) 325–335Google Scholar
- 5.Fu, Y.: Reaction Graph. To appear in Journal of Computer Science and Technology (1998)Google Scholar
- 6.Fu, Y.: Variations on Mobile Processes. To appear in Theoretical Computer Science, Elsevier Science PublisherGoogle Scholar
- 7.Hennessy, M., Milner, R.: Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM 67 (1985) 137–161CrossRefMathSciNetGoogle Scholar
- 8.Honda, K., Tokoro, M.: An Object Calculus for Asynchronous Communication. ECOOP’ 91, Geneve, Lecture Notes in Computer Science (1991)Google Scholar
- 9.Merro, M.: On the Expressiveness of Chi, Update and Fusion Calculus. Express’98 (1998)Google Scholar
- 10.Milner, R.: Communication and Concurrency. Prentice Hall (1989)Google Scholar
- 11.Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes. Information and Computation 100 (1992) Part I:1–40, Part II:41–77zbMATHCrossRefMathSciNetGoogle Scholar
- 12.Milner, R., Sangiorgi, D.: Barbed Bisimulation. ICALP’92, Lecture Notes in Computer Science 623 (1992) 685–695Google Scholar
- 13.Parrow, J., Victor, B.: The Update Calculus. Proceedings of AMAST’97, Sydney, December 13–17 (1997)Google Scholar
- 14.Parrow, J., Victor, B.: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. To appear in LICS’98 (1998)Google Scholar
- 15.Parrow, J., Victor, B.: The Tau-Laws of Fusion. To appear in CONCUR’98 (1998)Google Scholar
- 16.Sangiorgi, D.: A Theory of Bisimulation for π-Calculus. CONCUR’93, Lecture Notes in Computer Science 715 (1993)Google Scholar
- 17.Victor, B., Parrow, J.: Concurrent Constraints in the Fusion Calculus. To appear in ICALP’98 (1998)Google Scholar