1,111 research outputs found
Vesicle computers: Approximating Voronoi diagram on Voronoi automata
Irregular arrangements of vesicles filled with excitable and precipitating
chemical systems are imitated by Voronoi automata --- finite-state machines
defined on a planar Voronoi diagram. Every Voronoi cell takes four states:
resting, excited, refractory and precipitate. A resting cell excites if it has
at least one excited neighbour; the cell precipitates if a ratio of excited
cells in its neighbourhood to its number of neighbours exceed certain
threshold. To approximate a Voronoi diagram on Voronoi automata we project a
planar set onto automaton lattice, thus cells corresponding to data-points are
excited. Excitation waves propagate across the Voronoi automaton, interact with
each other and form precipitate in result of the interaction. Configuration of
precipitate represents edges of approximated Voronoi diagram. We discover
relation between quality of Voronoi diagram approximation and precipitation
threshold, and demonstrate feasibility of our model in approximation Voronoi
diagram of arbitrary-shaped objects and a skeleton of a planar shape.Comment: Chaos, Solitons & Fractals (2011), in pres
Modular Verification of Biological Systems
Systems of interest in systems biology (such as metabolic pathways, signalling pathways and gene regulatory networks) often consist of a huge number of components interacting in different ways, thus exhibiting very complex behaviours. In biology, such behaviours are usually explored by means of simulation techniques applied to models defined on the basis of system observation and of hypotheses on its functioning.
Model checking has also been recently applied to the analysis of biological systems. This analysis technique typically relies on a state space representation whose size, unfortunately, makes the analysis often intractable for realistic models. A method for trying to avoid the state space explosion problem is to consider a decomposition of the system, and to apply a modular verification technique.
In particular, properties to be verified often concern only a small portion of the modelled system rather than the system as a whole. Hence, for each property it would be useful to be able to isolate a minimal fragment of the model that is necessary to verify such a property.
In this thesis we introduce a modular verification technique in which the system of interest is described by means of an automata-based formalism, called sync-programs, that supports modular construction. Our modular verification technique is based on results of Grumberg et al.~and on their application to the theory of concurrent systems proposed by Attie and Emerson. In particular, we adapt Attie and Emerson's approach to deal with biological systems by allowing automata to synchronise by performing transitions simultaneously.
Modular verification allows qualitative aspects of systems to be analysed with the guarantee that properties proved to hold in a suitable model fragment also hold in the whole model. The correctness of the verification technique is proved. The class of properties preserved is ACTL, the universal fragment of temporal logic CTL. The preservation holds only for positive answers and negative answers are not necessarily preserved.
In order to verify properties we use the NuSMV model checker, which is a well-established and efficient instrument. We provide a formal translation of sync-programs to simpler automata, which can be given as input to NuSMV. We prove the correspondence of the verification problems.
We show the application of our verification technique in some biological case studies. We compare the time required to verify the property on the whole model with the time needed to verify the same property by only considering those modules which are involved in the behaviour of the system related to the property.
In order to handle modelling and verification of more realistic biological scenarios, we propose also a dynamic version of our formalism. It allows entities to be created dynamically, in particular by other already running entities, as it often happens in biological systems. Moreover, multiple copies of the same entities can be present at the same time in a system. We show a correspondence of our model with Petri Nets. This has a consequence that tools developed for Petri Nets could be used also for dynamic sync-programs. Modular verification allows properties expressed as DACTL- formulae (dynamic version of ACTL-) to be veriïŹed on a portion of the model.
The results of analysis of the case study of the MAP kinase cascade activated by surface and internalised EGF receptors, which consists of 143 species and 80 reactions, suggest applicability and scalability of the approach.
The results raise the prospect of rendering tractable problems that are currently intractable in the verification of biological systems. In addition, we expect that the techniques developed in the thesis could be applied with profit not only to models of biological systems, but more generally to models of concurrent systems
On Designing Multicore-aware Simulators for Biological Systems
The stochastic simulation of biological systems is an increasingly popular
technique in bioinformatics. It often is an enlightening technique, which may
however result in being computational expensive. We discuss the main
opportunities to speed it up on multi-core platforms, which pose new challenges
for parallelisation techniques. These opportunities are developed in two
general families of solutions involving both the single simulation and a bulk
of independent simulations (either replicas of derived from parameter sweep).
Proposed solutions are tested on the parallelisation of the CWC simulator
(Calculus of Wrapped Compartments) that is carried out according to proposed
solutions by way of the FastFlow programming framework making possible fast
development and efficient execution on multi-cores.Comment: 19 pages + cover pag
Artificial Wet Neuronal Networks from Compartmentalised Excitable Chemical Media (NEUNEU)
This document is a guide to the results of the NEUNEU research program, which is concerned with the development of mass-
producible chemical information processing components and their interconnection into functional architectures.This document is a guide to the results of the NEUNEU research program, which is concerned with the development of mass-
producible chemical information processing components and their interconnection into functional architectures
Representing Conversations for Scalable Overhearing
Open distributed multi-agent systems are gaining interest in the academic
community and in industry. In such open settings, agents are often coordinated
using standardized agent conversation protocols. The representation of such
protocols (for analysis, validation, monitoring, etc) is an important aspect of
multi-agent applications. Recently, Petri nets have been shown to be an
interesting approach to such representation, and radically different approaches
using Petri nets have been proposed. However, their relative strengths and
weaknesses have not been examined. Moreover, their scalability and suitability
for different tasks have not been addressed. This paper addresses both these
challenges. First, we analyze existing Petri net representations in terms of
their scalability and appropriateness for overhearing, an important task in
monitoring open multi-agent systems. Then, building on the insights gained, we
introduce a novel representation using Colored Petri nets that explicitly
represent legal joint conversation states and messages. This representation
approach offers significant improvements in scalability and is particularly
suitable for overhearing. Furthermore, we show that this new representation
offers a comprehensive coverage of all conversation features of FIPA
conversation standards. We also present a procedure for transforming AUML
conversation protocol diagrams (a standard human-readable representation), to
our Colored Petri net representation
Exploring Complex Networks with Graph Investigator Research Application
This paper describes Graph Investigator, the application intended for analysis of complex networks. A rich set of application functions is briefly described including graph feature generation, comparison, visualization and edition. The program enables to analyze global and local structural properties of networks with the use of various descriptors derived from graph theory. Furthermore, it allows to quantify inter-graph similarity by embedding graph patterns into low-dimensional space or distance measurement based on feature vectors. The set of available graph descriptors includes over eighty statistical and algebraic measures. We present two examples of real-world networks analysis performed with Graph Investigator: comparison of brain vasculature with structurally similar artificial networks and analysis of vertices importance in a macaque cortical connectivity network. The third example describes tracking parameters of artificial vascular network evolving in the process of angiogenesis, modelled with the use of cellular automata
Sensor potency of the moonlighting enzyme-decorated cytoskeleton
Background: There is extensive evidence for the interaction of metabolic enzymes with the eukaryotic
cytoskeleton. The significance of these interactions is far from clear.
Presentation of the hypothesis: In the cytoskeletal integrative sensor hypothesis presented here, the cytoskeleton
senses and integrates the general metabolic activity of the cell. This activity depends on the binding to the
cytoskeleton of enzymes and, depending on the nature of the enzyme, this binding may occur if the enzyme is
either active or inactive but not both. This enzyme-binding is further proposed to stabilize microtubules and
microfilaments and to alter rates of GTP and ATP hydrolysis and their levels.
Testing the hypothesis: Evidence consistent with the cytoskeletal integrative sensor hypothesis is presented in the
case of glycolysis. Several testable predictions are made. There should be a relationship between post-translational
modifications of tubulin and of actin and their interaction with metabolic enzymes. Different conditions of cytoskeletal
dynamics and enzyme-cytoskeleton binding should reveal significant differences in local and perhaps global levels and
ratios of ATP and GTP. The different functions of moonlighting enzymes should depend on cytoskeletal binding.
Implications of the hypothesis: The physical and chemical effects arising from metabolic sensing by the cytoskeleton
would have major consequences on cell shape, dynamics and cell cycle progression. The hypothesis provides a
framework that helps the significance of the enzyme-decorated cytoskeleton be determined
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
On the development of slime mould morphological, intracellular and heterotic computing devices
The use of live biological substrates in the fabrication of unconventional computing (UC) devices is steadily transcending the barriers between science fiction and reality, but efforts in this direction are impeded by ethical considerations, the fieldâs restrictively broad multidisciplinarity and our incomplete knowledge of fundamental biological processes. As such, very few functional prototypes of biological UC devices have been produced to date. This thesis aims to demonstrate the computational polymorphism and polyfunctionality of a chosen biological substrate â slime mould Physarum polycephalum, an arguably âsimpleâ single-celled organism â and how these properties can be harnessed to create laboratory experimental prototypes of functionally-useful biological UC prototypes. Computing devices utilising live slime mould as their key constituent element can be developed into a) heterotic, or hybrid devices, which are based on electrical recognition of slime mould behaviour via machine-organism interfaces, b) whole-organism-scale morphological processors, whose output is the organismâs morphological adaptation to environmental stimuli (input) and c) intracellular processors wherein data are represented by energetic signalling events mediated by the cytoskeleton, a nano-scale protein network. It is demonstrated that each category of device is capable of implementing logic and furthermore, specific applications for each class may be engineered, such as image processing applications for morphological processors and biosensors in the case of heterotic devices. The results presented are supported by a range of computer modelling experiments using cellular automata and multi-agent modelling. We conclude that P. polycephalum is a polymorphic UC substrate insofar as it can process multimodal sensory input and polyfunctional in its demonstrable ability to undertake a variety of computing problems. Furthermore, our results are highly applicable to the study of other living UC substrates and will inform future work in UC, biosensing, and biomedicine
- âŠ