Enumerated type semantics for the calculus of looping sequences

Livio Bioglio

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2011)

  • Volume: 45, Issue: 1, page 35-58
  • ISSN: 0988-3754

Abstract

top
The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure and the equilibrium between cell death and division: typed reductions prevent undesirable behaviors.

How to cite

top

Bioglio, Livio. "Enumerated type semantics for the calculus of looping sequences." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 45.1 (2011): 35-58. <http://eudml.org/doc/273032>.

@article{Bioglio2011,
abstract = {The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure and the equilibrium between cell death and division: typed reductions prevent undesirable behaviors.},
author = {Bioglio, Livio},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {system biology; predictive modelling; CLS; type systems; CLS type systems},
language = {eng},
number = {1},
pages = {35-58},
publisher = {EDP-Sciences},
title = {Enumerated type semantics for the calculus of looping sequences},
url = {http://eudml.org/doc/273032},
volume = {45},
year = {2011},
}

TY - JOUR
AU - Bioglio, Livio
TI - Enumerated type semantics for the calculus of looping sequences
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2011
PB - EDP-Sciences
VL - 45
IS - 1
SP - 35
EP - 58
AB - The calculus of looping sequences is a formalism for describing the evolution of biological systems by means of term rewriting rules. In this paper we enrich this calculus with a type discipline which preserves some biological properties depending on the minimum and the maximum number of elements of some type requested by the present elements. The type system enforces these properties and typed reductions guarantee that evolution preserves them. As an example, we model the hemoglobin structure and the equilibrium between cell death and division: typed reductions prevent undesirable behaviors.
LA - eng
KW - system biology; predictive modelling; CLS; type systems; CLS type systems
UR - http://eudml.org/doc/273032
ER -

References

top
  1. [1] R. Alur, C. Belta, V. Kumar and M. Mintz, Hybrid modeling and simulation of biomolecular networks, in Hybrid Systems: Computation and Control. Lecture Notes in Computer Science 2034 (2001) 19–32. Zbl0993.92010
  2. [2] B. Aman, M. Dezani-Ciancaglini and A. Troina, Type Disciplines for Analysing Biologically Relevant Properties, in Membrane Computing and Biologically Inspired Process Calculi (MeCBIC'08). Electronic Notes in Theoretical Computer Science 227 (2009) 97–111. Zbl06417440
  3. [3] R. Barbuti, A. Maggiolo-schettini and P. Milazzo, Extending the calculus of looping sequences to model protein interaction at the domain level, in Proceedings of International Symposium on Bioinformatics Research and Applications (ISBRA'07). Lecture Notes in Bioinformatics 4463 (2006) 638–649. 
  4. [4] R. Barbuti, A. Maggiolo-Schettini, P. Milazzo and A. Troina, Bisimulation congruences in the calculus of looping sequences, in Proceedings of International Colloquium on Theoretical Aspects of Computing (ICTAC'06). Lecture Notes in Computer Science 4281 (2006) 93–107. Zbl1168.68435MR2308009
  5. [5] R. Barbuti, A. Maggiolo-Schettini, P. Milazzo and A. Troina, A calculus of looping sequences for modelling microbiological systems. Fund. Inform.72 (2006) 21–35. Zbl1101.92021MR2265152
  6. [6] L. Bioglio, M. Dezani-Ciancaglini, P. Giannini and A. Troina, Type directed semantics for the calculus of looping sequences. International Journal of Software and Informatics (2010), to appear. Zbl1284.68317
  7. [7] L. Cardelli, Brane calculi – interactions of biological membranes, in Computational Methods in Systems Biology (2004) 257–278. Zbl1088.68657
  8. [8] V. Danos and C. Laneve, Formal molecular biology. Theoret. Comput. Sci.325 (2004) 69–110. Zbl1071.68041MR2085105
  9. [9] M. Dezani-Ciancaglini, P. Giannini and A. Troina, A Type System for Required/Excluded Elements in CLS, in Workshop on Developments in Computational Models (DCM'09). Electronic Proceedings in Theoretical Computer Science 9 (2009) 38–48. 
  10. [10] H. Matsuno, A. Doi, M. Nagasaki and S. Miyano, Hybrid Petri Net representation of gene regulatory networks, in Proceedings of the Pacific Symposium on Biocomputing (PSB '00) (2000), 338–349. http://www.marmisicc.com/index.aspx?IDMenu=76&idMenuAPP=11. 
  11. [11] P. Milazzo, Qualitative and Quantitative Formal Modeling of Biological Systems. Ph.D. thesis, University of Pisa (2007). 
  12. [12] G. Păun, Membrane Computing. An Introduction. Springer-Verlag (2002). Zbl1034.68037MR1992656
  13. [13] A. Regev and E. Shapiro, Cells as computation. Nature 419 (2002) 343. 
  14. [14] A. Regev and E. Shapiro, The π -calculus as an abstraction for biomolecular systems. Modelling in Molecular Biology (2004) 219–266. MR2320046
  15. [15] A. Regev, E.M. Panina, W. Silverman, L. Cardelli and E. Shapiro, Bioambients: An abstraction for biological compartments. Theoret. Comput. Sci.325 (2004) 141–167. Zbl1069.68569MR2085107
  16. [16] A. Syropoulos, Mathematics of multisets, in Multiset Processing. Lecture Notes in Computer Science2235 (2001) 347–358. Zbl1052.03030MR2054267
  17. [17] J.B. Wells, The essence of principal typings, in Proceedings of Intenational Colloquium on Automata, Languages and Programming (ICALP'02). Lecture Notes in Computer Science 2380 (2002) 913–925. Zbl1057.03023MR2062518

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.