Interactions between Causal Structures in Graph Rewriting Systems

  title={Interactions between Causal Structures in Graph Rewriting Systems},
  author={Ioana Cristescu and Walter Fontana and Jean Krivine},
Graph rewrite formalisms are a powerful approach to modeling complex molecular systems. They capture the intrinsic concurrency of molecular interactions, thereby enabling a formal notion of mechanism (a partially ordered set of events) that explains how a system achieves a particular outcome given a set of rewrite rules. It is then useful to verify whether the mechanisms that emerge from a given model comply with empirical observations about their mutual interference. In this work, our… 
1 Citations

Figures from this paper

Mechanistic model of MAPK signaling reveals how allostery and rewiring contribute to drug resistance

It is demonstrated the presence of two parallel MAPK (RAF-MEK-ERK kinase) reaction channels in BRAFV600E melanoma cells that are differentially sensitive to RAF and MEK inhibitors.



Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models

A novel way of constructing concise causal histories (pathways) to represent how specified structures are formed during simulation of systems represented by rule-based models is introduced, founded on a new, clean, graph-based semantics for Kappa.

Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction

A reduction method is constructed which generates (typically) far smaller systems of differential equations than the concrete/canonical one, and it is shown that the abstract/reduced differential system has solutions which are linear combinations of the canonical ones.

Formal molecular biology

A Software Package for Chemically Inspired Graph Transformation

A general software package for this type of graph rewriting system, which can be used for modelling chemical systems, and has extensive procedures for automatically visualising not only graphs and rewrite rules, but also Double Pushout diagrams and graph languages in form of directed hypergraphs.

Rule-Based Modelling, Symmetries, Refinements

This paper presents a method to refine rule sets in a way that preserves the implied stochastic semantics, and shows how to refine rules and which choice of refined rates will lead to a neutral refinement, i.e., one that has the same global activity as the original rule had.

Modelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars

This thesis provides graph transformation systems with truly concurrent semantics based on (concatenable) processes and on a Winskel’s style unfolding construction, as well as with more abstract semanticsbased on event structures and domains.

Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming

Rule-based modeling of biochemical systems with BioNetGen.

This work focuses on how a rule-based model is specified in the BioNetGen language (BNGL) and how a model specification is analyzed using the Bio netGen software tool.

Rule-Based Modelling of Cellular Signalling

It is shown how causality enables the formalization of the colloquial concept of pathway and, perhaps more surprisingly, how conflict can be used to dissect the signalling dynamics to obtain a qualitative handle on the range of system behaviours.

Scalable Simulation of Cellular Signaling Networks

A radically different method which does not attempt to count species is presented, which uses a representation of the system together with a super-approximation of its 'event horizon' (all events that may happen next), and a specific correction scheme to obtain exact timings.