Skip to main content
SpringerLink
Log in

Pi-Congruences as CCS Equivalences

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1999)

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

  • 258 Accesses

Abstract

We show the coincidence of non-ground π-calculus and πξ-calculus, a CCS-like calculus that allows processes to be explicitly represented as temporary functions of input parameters, and as permanent functions of their free names.

As intermediate results, strong and weak π-calculus full congruences are characterized as finitary closures of the corresponding π-bisimilarities. In this paper we consider only late π-calculus, but all of the characterizations can be easily adapted to deal with non-ground semantics of the early family.

Funded by the EU, under the Marie Curie TMR Programme.

Basic Research in Computer Science, Centre of the Danish National Research Foundation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. A Domain Equation for Bisimulation. Information and Computation, 92(2)161–2181991.

    Article  MATH  MathSciNet  Google Scholar 

  2. L. Aceto, B. Bloom, and F. Vaandrager. Turning SOS Rules into Equations. Information and Computation111(1):1–521994.

    Article  MATH  MathSciNet  Google Scholar 

  3. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent SystemsACM Trans. on Programming Languages and Systems15(1):36–721993.

    Article  Google Scholar 

  4. R. De Simone. Higher level synchronizing devices in MEIJE-SCCS. Theoretical Computer Science, 37(3):245–267, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  5. G.-L. Ferrari, U. Montanari, and P. Quaglia. The Weak Late π-calculus Semantics as Observation Equivalence. In I. Lee and S.A. Smolkaeditors, Proc. 6th International Conference on Concurrency Theory, CONCUR’95, volume 962 of LNCS, pages 57–71. Springer-Verlag, 1995.

    Google Scholar 

  6. G.-L. Ferrari, U. Montanari, and P. Quaglia. A π-calculus with Explicit SubstitutionsTheoretical Computer Science168(1):53–1031996.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Hennessy and H. Lin. Symbolic Bisimulations. Theoretical Computer Science138:353–3891995.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and ConcurrencyJournal of the ACM32(1):137–1611985.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the π-Calculus. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, Proc. 6th International Joint Conference CAAP/FASE, TAPSOFT’ 95, volume 915 of LNCS Springer-Verlag, 1995.

    Google Scholar 

  10. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–3101983.

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Part I and II. Information and Computation100(1)1–771992.

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science114(1)149–1711993.

    Article  MATH  MathSciNet  Google Scholar 

  13. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI-Conference, volume 104 of LNCS. Springer-Verlag, 1981.

    Google Scholar 

  14. G. D. Plotkin. A Structural Approach to Operational SemanticsTechnical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  15. P. Quaglia. The π-calculus with explicit substitutions. PhD thesis, Universitá degli Studi di Pisa, Dipartimento di Informatica1996Report TD-09/96.

    Google Scholar 

  16. P. Quaglia On the finitary characterization of π-congruencesBRICS Report RS-97-52 Computer Science Department, Aarhus University 1997.

    Google Scholar 

  17. D. Sangiorgi. A Theory of Bisimulation for the /gp-calculus. Acta Informatica, 33(1)69–971996.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Aarhus University, The Netherlands

    Paola Quaglia

Authors
  1. Paola Quaglia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Informática, Pontifícia Laboratório de Métodos Formais, Universidade Católica do Rio de Janeiro, Rua Marquês De São Vicente, 225, 22453-900, Rio de Janeiro, RJ, Brazil

    Armando M. Haeberer

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Quaglia, P. (1998). Pi-Congruences as CCS Equivalences. In: Haeberer, A.M. (eds) Algebraic Methodology and Software Technology. AMAST 1999. Lecture Notes in Computer Science, vol 1548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49253-4_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-49253-4_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65462-9

  • Online ISBN: 978-3-540-49253-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation