Parallelism and concurrency in high-level replacement systems
From MaRDI portal
Publication:4006236
DOI10.1017/S0960129500001353zbMath0749.68045MaRDI QIDQ4006236
Hartmut Ehrig, Francesco Parisi-Presicce, Hans-Joerg Kreowski, Annegret Habel
Publication date: 26 September 1992
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
graph grammars; Concurrency; Parallelism; Church-Rosser; replacement systems; algebraic specification grammars
68Q65: Abstract data types; algebraic specification
68Q42: Grammars and rewriting systems
18A30: Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
Related Items
The contractum in algebraic graph rewriting, An event structure semantics for graph grammars with parallel productions, On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH, Concurrency for Graph Grammars in a Petri net shell, Basic Results for Two Types of High-Level Replacement Systems, Adhesive and quasiadhesive categories, Processes and unfoldings: concurrent computations in adhesive categories, -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation, Locating the contractum in the double pushout approach, On categorical graph grammars integrating structural transformations and operations on labels, Categorical principles, techniques and results for high-level-replacement systems in computer science, Unfolding semantics of graph transformation, Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components, Construction and properties of adhesive and weak adhesive high-level replacement categories, Parallel high-level replacement systems, The uniqueness condition for the double pushout transformation of algebras, Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories, Connector Rewriting with High-Level Replacement Systems, Modelling Calculi with Name Mobility using Graphs with Equivalences, Unfolding Grammars in Adhesive Categories, Multi-amalgamated Triple Graph Grammars, From Algebraic Graph Transformation to Adhesive HLR Categories and Systems, Workshop on Petri Nets and Graph Transformations, Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions, Correctness of high-level transformation systems relative to nested conditions, Unnamed Item
Cites Work
