Parallel and sequential independence for borrowed contexts

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were missing for dpo rewriting extended with borrowed contexts (dpobc), a formalism used for equipping dpo derivations with labels and introduced for modeling open systems that interact with the environment. In this work we propose the definition of parallel and sequential independence for dpobc rewriting, and we prove that these novel notions allow generalizing the Church-Rosser and parallelism theorems holding for dpo rewriting. Most importantly, we show that the dpobc version of these theorems still guarantees the local confluence and the parallel execution of pairs of independent dpobc derivations. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bonchi, F., Gadducci, F., & Heindel, T. (2008). Parallel and sequential independence for borrowed contexts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 226–241). https://doi.org/10.1007/978-3-540-87405-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free