Skip to main content
SpringerLink
Log in

Inference systems for observation equivalences in the π-calculus

  • Published:
Science in China Series E: Technological Sciences Aims and scope Submit manuscript

Abstract

Inference systems for observation equivalences in the pi-calculus with recursion are proposed, and their completeness over the finite-control fragment with guarded recursions are proven. The inference systems consist of inference rules and equational axioms. The judgments are conditional equations which characterise symbolic bisimulations between process terms. This result on the one hand generalises Milner’s complete axiomatisation of observation equivalence for regular CCS to the pi-calculus, and on the other hand extends the proof systems of strong bisimulations for guarded regular pi-calculus to observation equivalences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Milner, R., Parrow, J., Walker, D., A calculus of mobile processes, part I, II,Information and Computation, 1992, 100: 1.

    Article  MATH  MathSciNet  Google Scholar 

  2. Parrow, J., Sangiorgi, D., Algebraic theories for name-passing calculi,Information and Computation, 1995, 120: 174.

    Article  MATH  MathSciNet  Google Scholar 

  3. Boreale, M., De Nicola, R., A symbolic semantics for the π-calculus,Information and Computation, 1996, 126: 34.

    Article  MATH  MathSciNet  Google Scholar 

  4. Lin, H., Axiomatisation of bisimulations in mobile processes,Advances in Theoretical Computer Science (in Chinese), 1994, 1: 1.

    Google Scholar 

  5. Lin, H., Complete inference systems for weak bisimulation equivalences in the π-calculus,LNCS, Berlin: Springer-Verlag, 1995, 915: 187.

    Google Scholar 

  6. Lin, H., Unique fixpoint induction for mobile processes,LNCS, Berlin: Springer-Verlag, 1995, 962: 88.

    Google Scholar 

  7. Dam, M., Model checking mobile processes,Information and Computation, 1996, 129: 35.

    Article  MATH  MathSciNet  Google Scholar 

  8. Hennessy, M., Lin, H., Symbolic bisimulations,Theoretical Computer Science, 1995, 138: 353.

    Article  MATH  MathSciNet  Google Scholar 

  9. Milner, R., A complete axiomatisation for observational congruence of finite-state behaviours,Information and Computation, 1989, 81: 227.

    Article  MATH  MathSciNet  Google Scholar 

  10. Lin, H., On removing unguarded recursions in the π-calculus,Journal of Software (in Chinese), 1997, 8: 321.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Institute of Software, Chinese Academy of Sciences, 100080, Beijing, China

    Huimin Lin

Authors
  1. Huimin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Project supported by the National Natural Science Foundation of China (Grant No. 69683003) and the Chinese Academy of Sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, H. Inference systems for observation equivalences in the π-calculus. Sci. China Ser. E-Technol. Sci. 42, 657–669 (1999). https://doi.org/10.1007/BF02917004

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02917004

Keywords

Search

Navigation