Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

0 of .
Results for:
No results containing your search query
P. 1
Luca Bianco, Federico Fontana, Giuditta Franco and Vincenzo Manca- P Systems for Biological Dynamics

Luca Bianco, Federico Fontana, Giuditta Franco and Vincenzo Manca- P Systems for Biological Dynamics

|Views: 572|Likes:
Published by Uloff

More info:

Published by: Uloff on Dec 14, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





Chapter 3P Systems for Biological Dynamics
Luca Bianco, Federico Fontana, Giuditta Franco, Vincenzo Manca
University of VeronaDepartment of Computer Sciencestrada Le Grazie 15, 37134 Verona, Italy
P systems have clear structural analogies with the cell. However, cer-tain difficulties arise when one attempts to represent a biomolecular process usingthese systems. This chapter suggests some ways to overcome such difficulties and toprovide P systems with further functionalities aimed at increasing their versatilityin the modeling of biomolecular processes. Concepts from state transition dynamicsare taken to put P systems in a general analysis framework for dynamical discretesystems. An explicit notion of environment is proposed to provide P systems witha regulatory and constraining agent, as real biomolecular processes must deal with.The chapter focuses on a new rewriting strategy inspired by biochemistry, in whichreactivities play a central role in driving the rules as it happens during biochemicalreactions. Tests on an algorithm implementing rewriting with reactivities, realizedon a simulator called
, show the capability of this algorithm to express sev-eral processes with precision, particularly those presenting oscillatory phenomena.Finally, an analysis of the process of leukocyte recruitment is also performed using
1 Introduction
We know that the simplicity of a computing device does not limit its power tosolve problems, assumed that its design criteria follow certain specificationsand enough space is provided to represent the data and to store the processingrules, as well as enough time is left to the device to compute the solution. Thisfact became clear after the Turing machine was designed and the proofs of universality and equivalence with other computing machines and formalisms(most of them being as simple as the architecture proposed by Alan Turing)were given. So, why a modern computer is in practice so different from aTuring machine, provided that it has the same computational power?The answer is obvious: a modern computer architecture is much betterinterfaced with the external world than a Turing machine, and, consequently,a task can be more easily implemented over it. Algorithms and features that
82 L. Bianco, F. Fontana, G. Franco, V. Manca
would need an indefinite time to be shaped to run on a Turing or a Von Neu-mann machine, are rapidly implemented over a modern computer instead. Onthe other hand, Turing machines and equivalent “ideal” architectures provedto be invaluable for crossing the bridge between computer theory and practice.In some sense, we can say that ideal machines cannot be avoided, althoughany practical application of them must move through the existence of moreelaborate systems.In 1998
P systems
were presented as a new model of computation [27].We argue that this model can be considered and developed in such a way tobecome an analogue of Turing machines, playing the role of a mathematicallyidealized model for biological systems. The following discussion will providespecific arguments for this claim.Before P systems, some other classes of rewriting systems have alreadyshown the ability of expressing specific biological phenomena [32, 20, 13]. Psystems move a step further: they have clear structural analogies with thecell, in particular they model several features of the biological membranes(for this reason they are often referred to as
membrane systems
). Moreover,the transitions happening in these systems recall certain evolution processesthat take place in a living cell.From a formal viewpoint, P systems satisfy a result of universality even intheir basic definition [27]. In this sense they have all the computational powerneeded to capture a biomolecular process – provided that we are able toarrange it into an algorithmic procedure. In addition to this, the similaritiesexisting between P systems and (at least some aspects of) biological cellsmight suggest that P systems are also able to represent the same process ina meaningful way, that is, not only to compute it as any universal machinewould do, but also to provide potential insight on the biological mechanismsdetermining and controlling the process via the observation of the transitionsof the system.Unfortunately, for most of the classes of P systems considered so far, thisis true only to some extent. Modeling specific biological activities inside aP system is not an easy task. A lot of alternative constructs derived fromthe basic definition of P system have been proposed, sometimes capturingcrucial aspects of the biology of cells such as
, communication via
[29, 26, 25],sometimes importing paradigms coming from other formal systems havingbiological implications too, such as
and object–structuring (in form of strings) [30]. All these alternative constructs exhibit properties of universality,hence by all means they represent a first, necessary attempt to move P systemscloser to the world of bio-molecules meanwhile preserving their computationalpower.Nevertheless there are some aspects, that are crucial in almost any studyof biomolecular processes, that the traditional formulations of P systems do
P Systems for Biological Dynamics 83
not take into major account (at least not so explicitly to turn into versatileconstructs for biological applications):
of bio-systems. The halting of a P system tells that a computa-tion has terminated successfully, but the dynamical behavior of biomolecu-lar processes has a major relevance in the description of the processes them-selves. This means that two or more processes that terminate with identicalconfigurations may move through completely different transitions. Thus,in the context of living organisms it is more appropriate to consider thedynamical patterns of the “life” evolving in a given environment. Theknowledge and classification of these patterns is a preliminary task for un-derstanding or influencing some behaviors (possibly harmfully) for specificpurposes.
Environmental energy 
. The resources available in the en-vironment play a major role in the control a biomolecular process. Theexistence in the environment of elements, which can act as catalysts orprovide the energy needed for the bio-chemical elements to react, can rad-ically change the nature of a process. In particular, an environment whichperiodically feeds the system with resources can transfer properties of pe-riodicity to the system as well.
system control. Biomolecular mechanisms are the result of many individual local reactions, each of those being formed by processeswhose extension is limited in time and space. These processes interactto each other by means of specific communication strategies, in a waythat they finally exhibit a (sometimes surprising) overall coordination. Inthis sense, and despite this coordination, biomolecular processes are by allmeans asynchronous.Clearly, these aspects are closely related one to the other: shifting the focuson the system dynamics means that less attention is payed to the final con-figuration of the system; meanwhile, the continuous control of the resourcesneeded by the process to evolve is fundamental to drive the system dynamicsalong a specific trajectory. The environment itself has the role of a “supervi-sor” in the process control, since it becomes responsible of a sort of externalinput, whose effects in the system propagate via local reactions.How today’s P systems deal with the points just outlined? About thefirst point, we know that P systems are intended to “consume” the availableresources in a maximally parallel way during the rewriting of symbols. Im-posing this property, all the symbols that are present in the system at a givenconfiguration become potential resources: they are consumed as many as pos-sible, and new symbols are produced in consequence of that action. In otherwords, maximal parallelism constrains the system to consume all the availableresources during a transition.We know that we can regulate the system evolution by adding auxiliarysymbols (and correspondent cooperative rules which use such symbols) or,alternatively, by providing the system with
constraints on the rules,

Activity (6)

You've already reviewed this. Edit your review.
1 hundred reads
ronaldbeat liked this
Tania Aedo Arankowsky liked this
chicotres liked this
Vlady Cabel liked this
Leonardo Broering Groff liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->