A Generic Language for Biological Systems based on Bigraphs

Several efforts have shown that process calculi developed for reasoning about concurrent and mobile systems may be employed for modelling biological systems at the molecular level. In this paper, we initiate investigation of the meta-language framework bigraphical reactive systems, due to Milner et al., as a basis for developing rule-based languages for molecular biology. We describe a family of BΣ,R-calculi sharing a small set of familiar operators and operations, and provide them with a simple operational semantics. We show that BΣ,R-calculi and their reaction semantics correspond to a version of bigraphical reaction under non-aliasing contexts and with reaction rules extended to allow negative side-conditions for the subset of bigraphs corresponding to BΣ,R-processes. Finally, to illustrate the usage of BΣ,R, we show that with non-aliasing semantics the κ-calculus may be faithfully captured as a BΣ,R-calculus.

[1]  Ugo Montanari,et al.  Saturated Semantics for Reactive Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[2]  Corrado Priami,et al.  Application of a stochastic name-passing calculus to representation and simulation of molecular processes , 2001, Inf. Process. Lett..

[3]  Robin Milner,et al.  Matching of Bigraphs , 2007, GT-VC@CONCUR.

[4]  Robin Milner,et al.  The Space and Motion of Communicating Agents , 2009 .

[5]  Vincent Danos,et al.  Rule-Based Modelling of Cellular Signalling , 2007, CONCUR.

[6]  Robin Milner,et al.  Stochastic Bigraphs , 2008, MFPS.

[7]  Robin Milner,et al.  Bigraphs and mobile processes (revised) , 2004 .

[8]  Søren Debois Sortings and Bigraphs , 2008 .

[9]  Vincent Danos,et al.  A Language for the Cell , 2008 .

[10]  Vincent Danos,et al.  Scalable Simulation of Cellular Signaling Networks , 2007, APLAS.

[11]  Thomas T. Hildebrandt,et al.  Formalizing Higher-Order Mobile Embedded Business Processes with Binding Bigraphs , 2008, COORDINATION.

[12]  Luca Cardelli,et al.  BioAmbients: an abstraction for biological compartments , 2004, Theor. Comput. Sci..

[13]  Aviv Regev,et al.  Representation and Simulation of Biochemical Processes Using the pi-Calculus Process Algebra , 2000, Pacific Symposium on Biocomputing.

[14]  Hartmut Ehrig,et al.  Deriving Bisimulation Congruences in the Presence of Negative Application Conditions , 2008, FoSSaCS.

[15]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[16]  Hartmut Ehrig,et al.  Graph-Grammars: An Algebraic Approach , 1973, SWAT.

[17]  Robin Milner,et al.  Pure bigraphs: Structure and dynamics , 2006, Inf. Comput..

[18]  Jan Friso Groote,et al.  SOS formats and meta-theory: 20 years after , 2007, Theor. Comput. Sci..

[19]  Marino Miculan,et al.  Reactive Systems over Directed Bigraphs , 2007, CONCUR.

[20]  K. Schmidt,et al.  Computer Supported Mobile Adaptive Business Processes , 2007 .

[21]  Yaron Goland,et al.  Web Services Business Process Execution Language , 2009, Encyclopedia of Database Systems.

[22]  Arne John Glenstrup,et al.  Formalizing WS-BPEL and Higher Order Mobile Em- bedded Business Processes in the Bigraphical Program- ming Languages (BPL) Tool , 2008 .

[23]  Robin Milner,et al.  Axioms for bigraphical structure , 2005, Mathematical Structures in Computer Science.

[24]  Luca Cardelli,et al.  Brane Calculi Interactions of Biological Membranes , 2004 .

[25]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[26]  Corrado Priami,et al.  Beta Binders for Biological Interactions , 2004, CMSB.

[27]  Cosimo Laneve,et al.  Formal molecular biology , 2004, Theor. Comput. Sci..

[28]  Lars Birkedal,et al.  Axiomatizing Binding Bigraphs , 2006, Nord. J. Comput..

[29]  Thomas T. Hildebrandt,et al.  Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names , 2006, GT-VC@CONCUR.

[30]  Hartmut Ehrig,et al.  Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts , 2006, Mathematical Structures in Computer Science.

[31]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .