Operational Patterns in Beta-Binders | SpringerLink
Skip to main content

Part of the book series: Lecture Notes in Computer Science ((TCSB,volume 3380))

Abstract

As a preliminary step in testing the expressiveness of Beta-binders against realistic case studies, we comment on a number of operational properties of the formalism and present a set of derived patterns that can be useful when modeling complex biosystems.

This work has been partially supported by the FIRB project “Modelli formali per Sistemi Biochimici”.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Cardelli, L.: Membrane interactions. In: BioConcur 2003, Workshop on Concurrent Models in Molecular Biology (2003)

    Google Scholar 

  2. Ciocchetta, F., Priami, C., Quaglia, P.: Modeling Kohn interaction maps with Beta-binders: an example (2004) (Submitted for publication)

    Google Scholar 

  3. Danos, V., Krivine, J.: Formal molecular biology done in CCS-R. In: BioConcur 2003, Workshop on Concurrent Models in Molecular Biology (2003)

    Google Scholar 

  4. Danos, V., Laneve, C.: Core formal molecular biology. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 302–318. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Danos, V., Laneve, C.: Core formal molecular biology. In: Full version of [4] (2004) (submitted for publication)

    Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  8. Priami, C., Quaglia, P.: Beta binders for biological interactions. In: Danos, V., Schachter, V. (eds.) CMSB 2004. LNCS (LNBI), vol. 3082, pp. 20–33. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Priami, C., Regev, A., Silverman, W., Shapiro, E.: Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters 80(1), 25–31 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  10. Regev, A., Panina, E.M., Silverman, W., Cardelli, L., Shapiro, E.: Bioambients: An abstraction for biological compartments. Theoretical Computer Science (2004) (to appear)

    Google Scholar 

  11. Regev, A., Silverman, W., Shapiro, E.: Representation and simulation of biochemical processes using the pi-calculus process algebra. In: Proc. of the Pacific Symposium on Biocomputing (PSB 2001), vol. 6, pp. 459–470. World Scientific Press, Singapore (2001)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Priami, C., Quaglia, P. (2005). Operational Patterns in Beta-Binders. In: Priami, C. (eds) Transactions on Computational Systems Biology I. Lecture Notes in Computer Science(), vol 3380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32126-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-32126-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25422-5

  • Online ISBN: 978-3-540-32126-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics