A compositional approach to performance modelling
A compositional approach to performance modelling
Information Processing Letters
Communication and Concurrency
Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
Theoretical Computer Science - Special issue: Computational systems biology
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
Modelling, property verification and behavioural equivalence of lactose operon regulation
Computers in Biology and Medicine
Bisimulations in calculi modelling membranes
Formal Aspects of Computing
A simple calculus for proteins and cells
Theoretical Computer Science
Bio-PEPA: A framework for the modelling and analysis of biological systems
Theoretical Computer Science
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
A compositional approach to the stochastic dynamics of gene networks
Transactions on Computational Systems Biology IV
Action-based analysis of discrete regulatory networks with short-term stimuli
Proceedings of the 8th International Conference on Computational Methods in Systems Biology
A semantic equivalence for Bio-PEPA based on discretisation of continuous values
Theoretical Computer Science
Design and development of software tools for Bio-PEPA
Winter Simulation Conference
Equivalences for a biological process algebra
Theoretical Computer Science
Hi-index | 0.00 |
Bio-PEPA is a process algebra for modelling biological systems. An important aspect of Bio-PEPA is the ability it provides to discretise concentrations resulting in a smaller, more manageable state space. The discretisation is based on a step size which determines the size of each discrete level and also the maximum number of levels. This paper considers the relationship between two discretisations of the same Bio-PEPA model that differ only in the step size and hence the maximum number of levels, by using the idea of equivalence from concurrency and process algebra. We present a novel behavioural semantic equivalence, compression bisimulation, that equates two discretisations of the same model and we show that this equivalence is a congruence with respect to the synchronisation operator.