ARTICLE
TITLE

On Parallel Graph Rewriting Systems

SUMMARY

In this paper we introduce a new theoretical paradigm, called PGR systems, which can be used to model in a discrete manner some natural phenomena occurring in-vivo/in-vitro en- vironments. PGR systems make use of graphs to describe the spatial structure of space of individuals, while the system dynamics caused by the movement/interaction of individuals is captured by the parallel applications of some graph rewriting rules. In this frame, an il- lustrative example is studied and based on it, an eloquent comparison between the abstract rewriting machines and PGR systems is done. Several further ideas to overcome the global computational effort needed for simulations, but still maintaining the overall ability for mod- eling are finally proposed.

 Articles related

Eunice Mphako-Banda,Julian A. Allagan    

We give some reduction formulas for  computing the Tutte polynomial of any graph with parallel classes. Several examples are given to illustrate our results.


Helmy Mukti Himawan, Panji Peksi Branjangan    

The main purpose of this research is to compare the response of a modeling and quadcopter implementation when it’s in  normal position and given a yaw-lock mixer input with some PID control parameters. Yaw is one of the movable axis parallel to the ... see more


Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer H. Rose    

We present the lambda sigma^a_w calculus, a formal synthesis of the concepts ofsharing and explicit substitution for weak reduction. We show howlambda sigma^a_w can be used as a foundation of implementations of functionalprogramming languages by modellin... see more


David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum    

We show that searching a width k maze is complete for Pi_k, i.e.,for the k'th level of the AC0 hierarchy. Equivalently, st-connectivityfor width k grid graphs is complete for Pi_k. As an application, weshow that there is a data structure solving dynamic ... see more


David A. Grable, Alessandro Panconesi    

Vertex colouring is a much studied problem in combinatorics and computer science for its theoretical as well as its practical aspects. In this paperwe are concerned with the "distributed" version of a question stated by Vizing, concerning a Brooks-like t... see more