Skip to main content
SpringerLink
Log in

The weak late π-calculus semantics as observation equivalence

  • Session: Mobile Processes I
  • Conference paper
  • First Online:
CONCUR '95: Concurrency Theory (CONCUR 1995)

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

Included in the following conference series:

Abstract

We show that the Weak Late π-calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions, due e.g. to communication, are explicitly handled via suitable constructors. The approach presented here allows to axiomatize the Weak Late π-calculus semantics by simply adding Milner's τ-laws to the proof system for the Strong equivalence. Resorting to Observation equivalence provides a framework which is general enough to allow to recover, in straightforward ways, other bisimulation semantics (e.g. Early, both Strong and Weak, and Dynamic and Branching, both Early and Late).

Work partially supported by ESPRIT BRA Project 6454 CONFER, and by Progetto Coordinato CNR ‘Strumenti per la Specifica e la Verifica di Proprietà Critiche di Sistemi Concorrenti e Distribuiti’.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto, B. Bloom, and F. Vaandrager. Turning SOS Rules into Equations. Information and Computation, 111(1):1–52, 1994.

    Google Scholar 

  2. L. Aceto. On “axiomatising finite concurrent processes”. SIAM Journal of Computing, 23(4):852–863, 1994.

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  5. G.-L. Ferrari, R. Gorrieri, and U. Montanari. An Extended Expansion Theorem. In S. Abramsky and T.S.E. Maibaum, editors, Proc. 3rd TAPSOFT, volume 494 of LNCS. Springer-Verlag, 1991.

    Google Scholar 

  6. G.-L. Ferrari, U. Montanari, and P. Quaglia. A π-calculus with Explicit Substitutions: the Late Semantics. In I. Prívara, B. Rovan, and P. Ružička, editors, Proc. 19th MFCS, volume 841 of Lecture Notes in Computer Science. Springer-Verlag, 1994.

    Google Scholar 

  7. G.-L. Ferrari, G. Modoni, and P. Quaglia. Towards a Semantic-Based Verification Environment for the π-calculus. Submitted for publication, 1995.

    Google Scholar 

  8. G.-L. Ferrari, U. Montanari, and P. Quaglia. A π-calculus with Explicit Substitutions. Full version of [FMQ94], to appear in Theoretical Computer Science, 1995.

    Google Scholar 

  9. M. Hennessy and H. Lin. Proof Systems for Message-Passing Process Algebras. In E. Best, editor, Proc. 4th CONCUR, volume 715 of LNCS. Springer-Verlag, 1993.

    Google Scholar 

  10. M. Hennessy and R. Milner. Algebraic Laws for Nondeterminism and Concurrency. Journal of the ACM, 32(1):137–161, 1985.

    Article  Google Scholar 

  11. H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the π-Calculus. To appear in the Proc. of TAPSOFT '95, 1995.

    Google Scholar 

  12. J. McCarthy. Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part 1. Communications of the ACM, 3, 1960.

    Google Scholar 

  13. R. Milner. A Calculus of Communicating Systems, volume 92 of LNCS. Springer-Verlag, 1980.

    Google Scholar 

  14. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.

    Article  Google Scholar 

  15. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.

    Google Scholar 

  16. R. Milner. Weak bisimilarity: congruences and equivalences. Unpublished notes, 1990.

    Google Scholar 

  17. R. Milner. The Polyadic π-Calculus: a Tutorial. Report ECS-LFCS-91-180, Comp. Science Dep., Edinburgh University, 1991.

    Google Scholar 

  18. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Part I and II. Information and Computation, 100(1):1–77, 1992.

    Article  Google Scholar 

  19. R. Milner, J. Parrow, and D. Walker. Modal logics for mobile processes. Theoretical Computer Science, 114(1):149–171, 1993.

    Article  Google Scholar 

  20. U. Montanari and V. Sassone. Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae, XVI:171–199, 1992.

    Google Scholar 

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

    Google Scholar 

  22. G. D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI-FN-19, Comp. Science Dep., Aarhus University, 1981.

    Google Scholar 

  23. R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In Information Processing, Proc. IFIP 11th World Computer Congress, pages 613–618, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Italia

    Gian-Luigi Ferrari, Ugo Montanari & Paola Quaglia

Authors
  1. Gian-Luigi Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paola Quaglia
    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

Ferrari, GL., Montanari, U., Quaglia, P. (1995). The weak late π-calculus semantics as observation equivalence. 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_5

Download citation

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

  • 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