Bisimulation congruences in the calculus of looping sequences

  • Authors:
  • Roberto Barbuti;Andrea Maggiolo-Schettini;Paolo Milazzo;Angelo Troina

  • Affiliations:
  • Dipartimento di Informatica, Università di Pisa, Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Pisa, Italy;Dipartimento di Informatica, Università di Pisa, Pisa, Italy

  • Venue:
  • ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Calculus of Looping Sequences (CLS) is a calculus suitable to describe biological systems and their evolution. CLS terms are constructed by starting from basic constituents and composing them by means of operators of concatenation, looping, containment and parallel composition. CLS terms can be transformed by applying rewrite rules. We give a labeled transition semantics for CLS by using, as labels, contexts in which rules can be applied. We define bisimulation relations that are congruences with respect to the operators on terms, and we show an application of CLS to the modeling of a biological system and we use bisimulations to reason about properties of the described system.