A Calculus of Looping Sequences with Local Rules

Livio Bioglio
(Dipartimento di Informatica, Università di Torino)
Mariangiola Dezani-Ciancaglini
(Dipartimento di Informatica, Università di Torino)
Paola Giannini
(Dipartimento di Informatica, Università di Torino)
Angelo Troina
(Dipartimento di Informatica, Università di Torino)

In this paper we present a variant of the Calculus of Looping Sequences (CLS for short) with global and local rewrite rules. While global rules, as in CLS, are applied anywhere in a given term, local rules can only be applied in the compartment on which they are defined. Local rules are dynamic: they can be added, moved and erased. We enrich the new calculus with a parallel semantics where a reduction step is lead by any number of global and local rules that could be performed in parallel. A type system is developed to enforce the property that a compartment must contain only local rules with specific features. As a running example we model some interactions happening in a cell starting from its nucleus and moving towards its mitochondria.

In Elham Kashefi, Jean Krivine and Femke van Raamsdonk: Proceedings 7th International Workshop on Developments of Computational Methods (DCM 2011), Zurich, Switzerland, 3rd July 2011, Electronic Proceedings in Theoretical Computer Science 88, pp. 43–58.
Published: 30th July 2012.

ArXived at: http://dx.doi.org/10.4204/EPTCS.88.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org