Bisimulations are well-established behavioural equivalences that are widely used to study properties 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.

Bisimulations in Calculi Modelling Membranes

TROINA, ANGELO
2008

Abstract

Bisimulations are well-established behavioural equivalences that are widely used to study properties 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.
2008
R. BARBUTI; A. MAGGIOLO-SCHETTINI; P. MILAZZO; A. TROINA
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/581035
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 25
  • ???jsp.display-item.citation.isi??? 21
social impact