Skip to main content
SpringerLink
Log in

Solo Diagrams

  • Conference paper
  • First Online:
Theoretical Aspects of Computer Software (TACS 2001)

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

Included in the following conference series:

Abstract

We address the problems of implementing the replication operator efficiently in the solos calculus — a calculus of mobile processes without prefix. This calculus is expressive enough to admit an encoding of the whole fusion calculus and thus the π-calculus. We show that nested occurrences of replication can be avoided, that the size of replicated terms can be limited to three particles, and that the usual unfolding semantics of replication can be replaced by three simple reduction rules. To illustrate the results and show how the calculus can be efficiently implemented we present a graphic representation of agents in the solos calculus, adapting ideas from interaction diagrams and pi-nets.

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. G. Bellin and P. Scott. On the π-calculus and linear logic. Theoretical Computer Science, 135:11–65, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

    Google Scholar 

  3. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In Proc. of POPL’ 96, pages 372–385. ACM, Jan. 1996.

    Google Scholar 

  4. Y. Fu. A proof-theoretical approach to communication. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of ICALP’ 97, volume 1256 of LNCS, pages 325–335. Springer, 1997.

    Google Scholar 

  5. Y. Fu. Reaction graph. Journal of Computer Science and Technology, Science Press, China, 13(6):510–530, 1998.

    Google Scholar 

  6. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1987.

    Google Scholar 

  7. G. Gonthier, M. Abadi, and J.-J. Lévy. The geometry of optimal lambda reduction. In Proc. of POPL’ 92, pages 15–26. ACM Press, 1992.

    Google Scholar 

  8. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In P. America, editor, Proc. of ECOOP’ 91, volume 512 of LNCS, pages 133–147. Springer, July 1991.

    Google Scholar 

  9. Y. Lafont. Interaction nets. In Proc. of POPL’ 90, pages 95–108. ACM Press, 1990.

    Google Scholar 

  10. C. Laneve and B. Victor. Solos in concert. In J. Wiederman, P. van Emde Boas, and M. Nielsen, editors, Proc. of ICALP’ 99, volume 1644 of LNCS, pages 513–523. Springer, July 1999.

    Google Scholar 

  11. C. Laneve and B. Victor. Solos in concert. Full version of [10], submitted for journal publication, February 2001.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. R. Milner. The polyadic π-calculus: A tutorial. In F. L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Series F. NATO ASI, Springer, 1993.

    Google Scholar 

  14. R. Milner. Pi-nets: A graphical form of π-calculus. In D. Sannella, editor, Proc. of ESOP’ 94, volume 788 of LNCS, pages 26–42. Springer, 1994.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. R. Milner and D. Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proc. of ICALP’ 92, volume 623 of LNCS, pages 685–695. Springer, 1992.

    Google Scholar 

  17. J. Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407–443, 1995.

    MathSciNet  Google Scholar 

  18. J. Parrow. Trios in concert. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000.

    Google Scholar 

  19. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proc. of LICS’ 98, pages 176–185. IEEE, Computer Society Press, July 1998.

    Google Scholar 

  20. B. C. Pierce and D. N. Turner. Pict: A programming language based on the picalculus. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000.

    Google Scholar 

  21. D. Sangiorgi. On the bisimulation proof method. Mathematical Structures in Computer Science, 8(5):447–479, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  22. N. Yoshida. Graph notation for concurrent combinators. In T. Ito and A. Yonezawa, editors, Proc. of TPPP’ 94, volume 907 of LNCS, pages 393–412. Springer, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Bologna, Italy

    Cosimo Laneve

  2. Royal Institute of Technology, Kista, Sweden

    Joachim Parrow

  3. Dept. of Computer Systems, Uppsala University, Sweden

    Björn Victor

Authors
  1. Cosimo Laneve
    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

  3. Björn Victor
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Tokyo Institute of Technology Graduate School of Information Science and Engineering, 2-12-1 Oo-okayama, Meguro-ku, Tokyo, 152-8552, Japan

    Naoki Kobayashi

  2. Department of Computer and Information Science, University of Pennsylvania, 200 S. 33rd St., Philadelphia, PA, 19104, USA

    Benjamin C. Pierce

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Laneve, C., Parrow, J., Victor, B. (2001). Solo Diagrams. In: Kobayashi, N., Pierce, B.C. (eds) Theoretical Aspects of Computer Software. TACS 2001. Lecture Notes in Computer Science, vol 2215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45500-0_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45500-0_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42736-0

  • Online ISBN: 978-3-540-45500-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation