Hostname: page-component-8448b6f56d-t5pn6 Total loading time: 0 Render date: 2024-04-16T23:47:34.187Z Has data issue: false hasContentIssue false

Enumerated type semantics for the calculus of looping sequences

Published online by Cambridge University Press:  15 March 2011

Livio Bioglio*
Affiliation:
Dipartimento di Informatica, Università di Torino, Torino, Italy; biogliol@di.unito.it
Get access

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.

Type
Research Article
Copyright
© EDP Sciences, 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Alur, R., Belta, C., Kumar, V. and Mintz, M., Hybrid modeling and simulation of biomolecular networks, in Hybrid Systems: Computation and Control. Lecture Notes in Computer Science 2034 (2001) 1932. CrossRef
Aman, B., Dezani-Ciancaglini, M. and Troina, A., 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) 97111. CrossRef
Barbuti, R., Maggiolo-schettini, A. and Milazzo, P., 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) 638649.
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P. and Troina, A., 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) 93107. CrossRef
Barbuti, R., Maggiolo-Schettini, A., Milazzo, P. and Troina, A., A calculus of looping sequences for modelling microbiological systems. Fund. Inform. 72 (2006) 2135.
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.
L. Cardelli, Brane calculi – interactions of biological membranes, in Computational Methods in Systems Biology (2004) 257–278.
Danos, V. and Laneve, C., Formal molecular biology. Theoret. Comput. Sci. 325 (2004) 69110. CrossRef
Dezani-Ciancaglini, M., Giannini, P. and Troina, A., Type System, A for Required/Excluded Elements in CLS, in Workshop on Developments in Computational Models (DCM'09). Electronic Proceedings in Theoretical Computer Science 9 (2009) 3848. CrossRef
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.
P. Milazzo, Qualitative and Quantitative Formal Modeling of Biological Systems. Ph.D. thesis, University of Pisa (2007).
G. Păun, Membrane Computing. An Introduction. Springer-Verlag (2002).
Regev, A. and Shapiro, E., Cells as computation. Nature 419 (2002) 343. CrossRef
A. Regev and E. Shapiro, The $\pi$ -calculus as an abstraction for biomolecular systems. Modelling in Molecular Biology (2004) 219–266.
Regev, A., Panina, E.M., Silverman, W., Cardelli, L. and Shapiro, E., Bioambients: An abstraction for biological compartments. Theoret. Comput. Sci. 325 (2004) 141167. CrossRef
Syropoulos, A., Mathematics of multisets, in Multiset Processing. Lecture Notes in Computer Science 2235 (2001) 347358. CrossRef
Wells, J.B., The essence of principal typings, in Proceedings of Intenational Colloquium on Automata, Languages and Programming (ICALP'02). Lecture Notes in Computer Science 2380 (2002) 913925. CrossRef