Skip to main content
SpringerLink
Log in

Constraints as processes

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

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

Included in the following conference series:

Abstract

We present a compositional encoding of the γ-calculus into the π-calculus. The former, used in the Oz semantics, is a recent small language with equational constraints over logical variables; the latter is a basic calculus of interacting processes. We establish a close correspondence between the reductions in the γ-calculus and its encoding, using weak barbed bisimulation congruence.

Work partially supported by ESPRIT BRA project No. 8130: LOMAPS.

Work partially supported by The Human Capital and Mobility Project EXPRESS.

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. R. Amadio and M. Dam. Toward a modal theory of types for the π-calculus. 1996. To appear in the proceedings of FTRTFT'96, Lecture Notes in Computer Science.

    Google Scholar 

  2. M. Dam. Model checking mobile processes. In E. Best, editor, CONCUR'93, 4 th Intl. Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 22–36. Springer-Verlag, 1993. Full version in Research Report R94∶01, Swedish Institute of Computer Science, Kista, Sweden.

    Google Scholar 

  3. G. Ferrari, G. Modoni and P. Quaglia. Towards a semantic-based verification environment for the pi-calculus. In Proceedings of 5th Italian Conference on Theoretical Computer Science: ICTCS-95. World Scientific, 1995.

    Google Scholar 

  4. B. Li. A π-calculus specification of Prolog. In D. Sannella, editor, Proceedings of European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 379–393, Edinburgh, 1994. Springer-Verlag.

    Google Scholar 

  5. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  6. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, October 1991. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer-Verlag, 1993.

    Google Scholar 

  7. R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.

    Google Scholar 

  8. R. Milner, J. Parrow and D. Walker. A calculus of mobile processes, Parts I and II. Journal of Information and Computation, 100:1–77, September 1992.

    Google Scholar 

  9. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proc. of 19th International Colloquium on Automata, Languages and Programming (ICALP '92), volume 623 of Lecture Notes in Computer Science, pages 685–695. Springer-Verlag, 1992.

    Google Scholar 

  10. R. Milner and D. Sangiorgi. The problem of “weak bisimulation up-to”. In R. Cleaveland, editor, CONCUR'92, 3 rd Intl. Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science. Springer-Verlag, 1992. Revised version available as ftp://ftp.dcs.ed.ac.uk/pub/sad/x.ps.Z, entitled Techniques of “weak bisimulation up-to”.

    Google Scholar 

  11. J. Niehren and M. Müller. Constraints for free in concurrent computation. In K. Kanchanasut and J.-J. Lévy, editors, Asian Computing Science Conference on Algorithms, Concurrency and Knowledge (ACSC '95), volume 1023 of Lecture Notes in Computer Science, Pathumthani, Thailand, 11–13 December 1995. Springer-Verlag.

    Google Scholar 

  12. B. C. Pierce, D. Rémy and D. N. Turner. A typed higher-order programming language based on the pi-calculus. In Workshop on Type Theory and its Application to Computer Systems, Kyoto University, July 1993.

    Google Scholar 

  13. J. Parrow and D. Sangiorgi. Algebraic theories for name-passing calculi. Journal of Information and Computation, 120(2):174–197, 1995.

    Google Scholar 

  14. M. Pistore and D. Sangiorgi. A partition refinement algorithm for the π-calculus. 1996. To appear in the proceedings of CAV'96, Lecture Notes in Computer Science.

    Google Scholar 

  15. B. Ross. A π-calculus semantics of logical variables and unification. In S. Purushothaman and A. Zwarico, editors, Proceedings of First North American Process Algebra Workshop, Stony Brook, 1992, Workshops in Computing, pages 216–230. Springer-Verlag, 1993.

    Google Scholar 

  16. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh, UK, 1992.

    Google Scholar 

  17. D. Sangiorgi. On the proof method for bisimulation (extended abstract). In J. Wiederman and P. Hájek, editors, Mathematical Foundations of Computer Science 1995 (MFCS'95), volume 969 of Lecture Notes in Computer Science, pages 479–488. Springer-Verlag, 1995. Full version available electronically as ftp://ftp.dcs.ed.ac.uk/pub/sad/bis-proof.ps.z.

    Google Scholar 

  18. D. Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33:69–97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in LNCS 715 (Proc. CONCUR'93).

    Google Scholar 

  19. G. Smolka. A foundation for higher-order concurrent constraint programming. In J.-P. Jouannaud, editor, Proc. 1st International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 50–72. Springer-Verlag, September 1994. Available as Research Report RR-94-16 from DFKI Kaiserslautern.

    Google Scholar 

  20. G. Smolka. The definition of Kernel Oz. In A. Podelski, editor, Constraints: Basics and Trends, volume 910 of Lecture Notes in Computer Science, pages 251–292. Springer-Verlag, 1995.

    Google Scholar 

  21. G. Smolka. An Oz primer. DFKI Oz documentation series, DFKI, Saarbrücken, Germany, 1995. Available as ftp://ps-ftp.dfki.uni-sb.de/pub/oz/documentation/Primer.ps.Z.

    Google Scholar 

  22. B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Imperial College, University of London, September 1990.

    Google Scholar 

  23. B. Thomsen, L. Leth, S. Prasad, T.-S. Kuo, A. Kramer, F. Knabe and A. Giacalone. Facile Antigua release — programming guide. Technical Report ECRC-93-20, ECRC, München, Germany, 1993.

    Google Scholar 

  24. B. Victor and F. Moller. The Mobility Workbench — a tool for the π-calculus. In D. Dill, editor, Computer Aided Verification (Proc. of CAV'94), volume 818 of Lecture Notes in Computer Science, pages 428–440. Springer-Verlag, 1994.

    Google Scholar 

  25. D. Walker. Objects in the π-calculus. Journal of Information and Computation, 116(2):253–271, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Systems, Uppsala University, Box 325, S-751 05, Uppsala, Sweden

    Björn Victor

  2. Dept. of Teleinformatics, Royal Institute of Technology, Electrum 204, S-164 40, Kista, Sweden

    Joachim Parrow

Authors
  1. Björn Victor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joachim Parrow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Victor, B., Parrow, J. (1996). Constraints as processes. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation