M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church-Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework o...
| Autores: | ; ; ; ; |
|---|---|
| Tipo de documento: | Artículo |
| Fecha de publicación: | 2014 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Lenguaje: | Inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/115944 |
| Acceso en línea: | https://hdl.handle.net/2117/115944 https://dx.doi.org/10.1017/S0960129512000357 |
| Nivel de acceso: | Acceso abierto |
| Palabra clave: | Parallel programming (Computer science) Graph-transformations Distributed systems Synchronization Confluence Categories Programs Grammars Model Programació en paral·lel (Informàtica) Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church-Rosser, Parallelism, Concurrency and Amalgamation Theorems for rules with nested application conditions in the framework of M-adhesive categories, where M-adhesive categories are slightly more general than weak adhesive high-level replacement categories. Most of the proofs are based on the corresponding statements for rules without application conditions and two shift lemmas stating that nested application conditions can be shifted over morphisms and rules. |
|---|