Skip to main content
SpringerLink
Log in

On Beta-Binders Communications

  • Chapter
Concurrency, Graphs and Models

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5065))

  • 779 Accesses

Abstract

Beta-binders is a bio-inspired formalism with a formal reduction semantics in the process calculi style. The terms of the language are boxes with an internal processing engine and provided with interfaces for interactions with the other boxes in the environment.

Although Beta-binders shares some features with Ambient-like calculi, it exhibits a quite distinctive communication paradigm which might show to be relevant to modelling scenarios other than the biological ones. In the perspective of developing a formal theory for the language, and hence deepening the understanding of such a communication paradigm, here we define a labelled semantics for Beta-binders and show its correspondence to the original reduction semantics.

This work has been partially sponsored by the PRIN 2006 Project BISCA - Sistemi e calcoli di ispirazione biologica e loro applicazioni.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Cardelli, L.: Brane Calculi. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082. Springer, Heidelberg (2005)

    Google Scholar 

  2. Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Degano, P., Prandi, D., Priami, C., Quaglia, P.: Beta-binders for Biological Quantitative Experiments. In: Proc. 4th Workshop on Quantitative Aspects of Programming Languages, QAPL 2006. ENTCS, vol. 164, pp. 101–117 (2006)

    Google Scholar 

  4. Ferrari, G.-L., Montanari, U., Quaglia, P.: A π-calculus with Explicit Substitutions. Theoretical Computer Science 168(1), 53–103 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hennessy, M., Lin, H.: Symbolic Bisimulations. Theoretical Computer Science 138, 353–389 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Larcher, R., Ihekwaba, A., Priami, C.: A BetaWB model for the NFkB pathway. Technical Report TR-25-2007, The Microsoft Research - University of Trento Centre for Computational and Systems Biology (2007)

    Google Scholar 

  7. Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  8. Milner, R.: Communicating and mobile systems: the π-calculus. Cambridge University Press, Cambridge (1999)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Perelson, A.S., Oster, G.F.: Theoretical studies of clonal selection: minimal antibody repertoire size and reliability of self-non-self discrimination. J. Theoretical Biology 81(4) (1979)

    Google Scholar 

  11. Prandi, D., Priami, C., Quaglia, P.: Shape spaces in formal interactions. ComPlexUs 2(3-4), 128–139 (2006)

    Article  Google Scholar 

  12. Prandi, D., Priami, C., Quaglia, P.: Communicating by Compatibility. Journal of Logic and Algebraic Programming (to appear, 2007)

    Google Scholar 

  13. Priami, C., Quaglia, P.: Beta Binders for Biological Interactions. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 21–34. Springer, Heidelberg (2005)

    Google Scholar 

  14. Regev, A., Panina, E.M., Silverman, W., Cardelli, L., Shapiro, E.Y.: Bioambients: an abstraction for biological compartments. Theoretical Computer Science 325(1), 141–167 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Romanel, A., Dematté, L., Priami, C.: The Beta Workbench. Technical Report TR-03-2007, The Microsoft Research - University of Trento Centre for Computational and Systems Biology (2007)

    Google Scholar 

  16. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

    Google Scholar 

  17. Shinwell, M.R.: The Fresh Approach: functional programming with names and binders. PhD thesis, University of Cambridge Computer Laboratory (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria e Scienza dell’Informazione, Università di Trento, Italy

    Paola Quaglia

Authors
  1. Paola Quaglia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Pierpaolo Degano Rocco De Nicola José Meseguer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Quaglia, P. (2008). On Beta-Binders Communications . In: Degano, P., De Nicola, R., Meseguer, J. (eds) Concurrency, Graphs and Models. Lecture Notes in Computer Science, vol 5065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68679-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-68679-8_28

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68679-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation