Parallelism and concurrency in high-level replacement systems
From MaRDI portal
Publication:4006236
DOI10.1017/S0960129500001353zbMath0749.68045OpenAlexW2120995755MaRDI 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)
Full work available at URL: https://doi.org/10.1017/s0960129500001353
graph grammarsConcurrencyParallelismChurch-Rosserreplacement systemsalgebraic specification grammars
Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Related Items
Unfolding Grammars in Adhesive Categories ⋮ Adhesive and quasiadhesive categories ⋮ Unfolding semantics of graph transformation ⋮ Abstract graph derivations in the double pushout approach ⋮ Note on standard representation of graphs and graph derivations ⋮ Canonical derivations for high-level replacement systems ⋮ Single pushout transformations of equationally defined graph structures with applications to actor systems ⋮ Semantics of full statecharts based on graph rewriting ⋮ Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system ⋮ Multi-amalgamated Triple Graph Grammars ⋮ Parallel high-level replacement systems ⋮ Horizontal and vertical structuring techniques for statecharts ⋮ Concurrent graph and term graph rewriting ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Workshop on Petri Nets and Graph Transformations ⋮ Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions ⋮ Unnamed Item ⋮ Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ Locating the contractum in the double pushout approach ⋮ The contractum in algebraic graph rewriting ⋮ An event structure semantics for graph grammars with parallel productions ⋮ On categorical graph grammars integrating structural transformations and operations on labels ⋮ Categorical principles, techniques and results for high-level-replacement systems in computer science ⋮ 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 ⋮ The uniqueness condition for the double pushout transformation of algebras ⋮ Processes and unfoldings: concurrent computations in adhesive categories ⋮ -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation ⋮ Correctness of high-level transformation systems relative to nested conditions ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications ⋮ 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 ⋮ A generalized concurrent rule construction for double-pushout rewriting
Cites Work
