Abstract
Testing equivalence on π processes has been studied in literature. The equivalence is not closed under the input prefix operator and is therefore not a congruence relation. This note takes a look at testing congruence on finite π processes. A complete equational system is given for the congruence relation.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
M Boreale, R De Nicola. Testing equivalence for mobile processes.Information and Computation, 1995, 120: 279–303.
R De Nicola, M Hennessy. Testing equivalence for processes.Theoretical Computer Science, 1984, 34: 83–133.
Fu Yuxi. A proof theoretical approach to communications. InICALP’97, July 7th–11th, Bologna, Italy, Lecture Notes in Computer Science 1256, Springer, 1997, pp.325–335.
Fu Yuxi. Bisimulation lattice of chi processes. InASIAN’98, December 8–10, Manila, The Philippines, Lecture Notes in Computer Science 1538, Springer, 1998, pp.245–262.
Fu Yuxi, Variations on mobile processes.Theoretical Computer Science, 1999, 221: 327–368.
Fu Yuxi. Open bisimulations of chi processes. InCONCUR’99, Eindhoven, The Netherlands, August 24–27, Lecture Notes in Computer Science 1664, Springer, 1999, pp.304–319.
Fu Yuxi. An open problem of mobile processes. Note.
Fu Yuxi, Yang Z. Open bisimularity of mobile process calculi.Chinese Journal of Computers, 2001, 24 (7): 673–679.
Fu Yuxi, Yang Z. Chi calculus with mismatch. InCONCUR 2000, August 22–25, Pennsylvenia, USA, Lecture Notes in Computer Science 1877, Springer, 2000, pp.596–610.
Fu Yuxi, Yang Z. The ground congruence for chi calculus. InFST&TCS 2000, December 13–15, India, Lecture Notes in Computer Science 1974, Springer, 2000, pp.385–396.
Hennessy M. An Algebraic Theory of Processes. MIT Press, Cambridge, MA, 1988.
Hennessy M, Lin H. Symbolic bisimulations.Theoretical Computer Science, 1995, 138: 353–369.
Lin H. Complete inference systems for weak bisimulation equivalences in the π-calculus. InProceedings of TAP-SOFT’95, Lecture Notes in Computer Science 915, Springer, 1995.
Milner R. Communication and Concurrency. Prentice Hall, 1989.
Milner R, Parrow J, Walker D. A calculus of mobile processes.Information and Computation, 100: 1–40 (Part I). 41–77 (Part II), Academic Press.
Parrow J, Sangiorgi D. Algebraic theories for name-passing calculi.Journal of Information and Computation, 1995, 120: 174–197.
Sangiorgi D. A theory of bisimulation for π-calculus. InCONCUR 93, Lecture Notes in Computer Science 715. Springer, 1993.
Author information
Authors and Affiliations
Corresponding author
Additional information
The work is supported by the NNSFC (No.69873032), the Young Scientist Research Fund and the University Scholar Funding Scheme. It is also supported by BASICS, Center of Basic Studies in Computing Science, sponsored by Shanghai Education Commission. BASICS is affiliated to the Department of Computer Science of Shanghai Jiaotong University.
FU Yuxi is a professor at the Department of Computer Science of Shanghai Jiaotong University. He received his Ph.D. degree in 1992 from Manchester University, England. His current research interests include concurrency theory, type theory and semantics.
Rights and permissions
About this article
Cite this article
Fu, Y. Testing congruence for mobile processes. J. Comput. Sci. & Technol. 17, 73–82 (2002). https://doi.org/10.1007/BF02949827
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02949827