Bisimulations are well–established behavioural equivalences that are widely used to study prop- erties of computer science systems. Bisimulations assume the behaviour of systems to be described as labelled transition systems, and properties of a system can be verified by assessing its bisimilarity with a system one knows to enjoy those properties. In this paper we show how semantics based on labelled transition systems and bisimulations can be defined for two formalisms for the description of biological systems, both capable of describing membrane interactions. These two formalisms are the Calculus of Looping Sequences (CLS) and Brane Calculi, and since they stem from two different approaches (rewrite systems and process calculi) bisimulation appears to be a good candidate as a general verification method. We introduce CLS and define a labelled semantics and bisimulations for which we prove some congruence results. We show how bisimulations can be used to verify properties by way of two examples: the description of the regulation of lactose degradation in Escherichia coli and the description of the EGF signalling pathway. We recall the PEP calculus (the simplest of Brane Calculi) and its translation into CLS, we define a labelled semantics and some bisimulation congruences for PEP processes, and we prove that bisimilar PEP processes are translated into bisimilar CLS terms.
|Autori:||BARBUTI R; MAGGIOLO SCHETTINI A; MILAZZO P; TROINA A|
|Titolo:||Bisimulations in Calculi Modelling Membranes|
|Anno del prodotto:||2008|
|Digital Object Identifier (DOI):||10.1007/s00165-008-0071-x|
|Appare nelle tipologie:||1.1 Articolo in rivista|