Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Communication and Concurrency
From pi-Calculus to Higher-Order pi-Calculus - and Back
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Theoretical Computer Science - Special issue: Computational systems biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Electronic Notes in Theoretical Computer Science (ENTCS)
Stochastic biological modelling in the presence of multiple compartments
Theoretical Computer Science
Bio-PEPA: A framework for the modelling and analysis of biological systems
Theoretical Computer Science
A Higher-Order Graph Calculus for Autonomic Computing
Graph Theory, Computational Intelligence and Thought
A Port Graph Calculus for Autonomic Computing and Invariant Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Extending the calculus of looping sequences to model protein interaction at the domain level
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Modelization and simulation of nano devices in nanok calculus
CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
The calculus of looping sequences
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
π@: a π-based process calculus for the implementation of compartmentalised bio-inspired calculi
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
An Analysis for Causal Properties of Membrane Interactions
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The use of process calculi to represent biological systems has led to the design of different calculi such as brane calculi [Luca Cardelli. Brane calculi. In CMSB, pages 257-278, 2004] and @k-calculus [Vincent Danos and Cosimo Laneve. Formal molecular biology. Theoritical Computer Science, 325(1):69-110, 2004]. Both have proved to be useful to model different types of biological systems. As an attempt to unify the two directions, we introduce the bio@k-calculus, a simple calculus for describing proteins and cells, in which bonds are represented by means of shared names and interactions are modelled at the domain level. Protein-protein interactions have to be at most binary and cell interactions have to fit with sort constraints. We define the semantics of bio@k-calculus, analyse its properties, and discuss its expressiveness by modelling two significant examples: a signalling pathway and a virus infection.