Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1995: CONCUR '95: Concurrency Theory pp 88–102Cite as

Unique fixpoint induction for mobile processes

  • Session: Mobile Processes II
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 962))

Abstract

Complete proof systems for bisimulation equivalences in the π-calculus with recursion are presented. The key inference rule dealing with recursion is unique fixpoint induction which generalises that used in [Mil84] for regular pure-CCS. It is shown that the proof systems are sound, and also complete when restricted to the subset of π-calculus where recursions are guarded and the parallel composition is disallowed. These results on the one hand extend the proof systems for recursion-free π-calculus in [Lin94, Lin95] to infinite processes, on the other hand extend the inference system for guarded regular pure-CCS of [Mil84] to π-calculus.

Supported by the President Fund of the Chinese Academy of Sciences, the National Science Foundation of China, and the EU KIT project SYMSEM.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Boreale and R. DeNicola. Testing equivalence for mobile processes. In CONCUR'92, number 630 in Lecture Notes in Computer Science, pages 2–16. Springer-Verlag, 1992.

    Google Scholar 

  2. M. Boreale and R. DeNicola. A symbolic semantics for the π-calculus. In CONCUR'94, Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  3. M. Dam. On the decidability of process equivalences for the π-calculus. Submitted, 1994. Swedish institute of Computer Science.

    Google Scholar 

  4. M. Hennessy. A proof system for communicating processes with value-passing. Formal Aspects of Computing, 3:346–366, 1991.

    Article  Google Scholar 

  5. M. Hennessy and H. Lin. Proof systems for message-passing process algebras. In CONCUR '93, number 715 in Lecture Notes in Computer Science, pages 202–216, 1993.

    Google Scholar 

  6. H. Lin. Symbolic bisimulations and proof systems for the π-calculus. Report 7/94, Computer Science, University of Sussex, 1994.

    Google Scholar 

  7. H. Lin. Complete inference systems for weak bisimulation equivalences in the π-calculus. In Proceedings of Sixth International Joint Conference on the Theory and Practice of Software Development, Lecture Notes in Computer Science. Springer-Verlag, 1995.

    Google Scholar 

  8. R. Milner. A complete inference system for a class of regular behaviours. J. Computer and System Science, 28:439–466, 1984.

    Article  Google Scholar 

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

    Article  Google Scholar 

  10. J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Report ECS-LFCS-93-262, LFCS, University of Edinburgh, 1993.

    Google Scholar 

  11. D. Sangiorgi. A theory of bisimulation for the π-calculus. In CONCUR'93, number 715 in Lecture Notes in Computer Science, 1993.

    Google Scholar 

  12. D. Sangiorgi. On the bisimulation proof method. Technical Report ECS-LFCS-94-299, LFCS, Edinburgh University, 1994. Extended abstract to appear in MFCS'95.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science Institute of Software, Chinese Academy of Sciences, P.O Box 8718, 100080, Beijing

    H. Lin

Authors
  1. H. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, H. (1995). Unique fixpoint induction for mobile processes. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

  • Online ISBN: 978-3-540-44738-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation