scientific article; zbMATH DE number 3633737
From MaRDI portal
Publication:4194478
zbMath0407.68072MaRDI QIDQ4194478
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research SurveyCompilerElementary ExpositionDevelopmental SystemData Base SystemRecursively Defined FunctionsAlgebraic Theory of Graph GrammarsCategorical MethodsChurch- Rosser PropertiesEvolution in BiologyGluing ConstructionsParallel Graph GrammarsRecord HandlingSequential Graph Grammar
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Categories of machines, automata (18B20)
Related Items
Theorem proving graph grammars with attributes and negative application conditions ⋮ Implementing term rewriting by graph reduction: Termination of combined systems ⋮ Term graph rewriting and garbage collection using opfibrations ⋮ An Institution for Graph Transformation ⋮ Graph theoretic closure properties of the family of boundary NLC graph languages ⋮ Net processes correspond to derivation processes in graph grammars ⋮ Combinatorial properties of boundary NLC graph languages ⋮ String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing ⋮ Categorical approach to the construction of fuzzy graph grammars ⋮ CGOOD, a categorical graph-oriented object data model ⋮ Characteristics of graph languages generated by edge replacement ⋮ An axiomatic definition of context-free rewriting and its application to NLC graph grammars ⋮ Parallelism in AGREE Transformations ⋮ Adhesive and quasiadhesive categories ⋮ Structural and behavioural compatibility of graphical service specifications ⋮ Comparison of two graph-rewrite systems ⋮ Amalgamation of domain specific languages with behaviour ⋮ Confluence of indirection reductions in graph rewrite systems ⋮ Fault trees on a diet: automated reduction by graph rewriting ⋮ Implementing term rewriting by jungle evaluation ⋮ 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 ⋮ Parallelism in single-pushout graph rewriting ⋮ Semantics of full statecharts based on graph rewriting ⋮ On relating rewriting systems and graph grammars to event structures ⋮ Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system ⋮ A decade of TAPSOFT ⋮ On the expressive power of algebraic graph grammars with application conditions ⋮ Parallel high-level replacement systems ⋮ Algebraic transformation of unary partial algebras. I: Double-pushout approach ⋮ On linearly oriented pullback and classes of algebras ⋮ Specifying graph languages with type graphs ⋮ On termination of graph rewriting ⋮ A uniform approach to graph rewriting: The pullback approach ⋮ Transformations in Reconfigurable Place/Transition Systems ⋮ Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes ⋮ Concurrent graph and term graph rewriting ⋮ Multilevel graph grammars ⋮ Specification of graph translators with triple graph grammars ⋮ How to delete categorically -- two pushout complement constructions ⋮ A characterization of context-free string languages by directed node- label controlled graph grammars ⋮ Decision problems for node label controlled graph grammars ⋮ Correct transformation: from object-based graph grammars to PROMELA ⋮ On the generative power of sequential and parallel programmed graph grammars ⋮ Graph grammars with neighbourhood-controlled embedding ⋮ Graph grammars and operational semantics ⋮ Processes of transforming structures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Foundations of rule-based design of modular systems ⋮ Unnamed Item ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ Locating the contractum in the double pushout approach ⋮ Confluence for graph transformations ⋮ Confluence theory for graphs ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ The contractum in algebraic graph rewriting ⋮ A category-theoretical approach to vertex replacement: The generation of infinite graphs ⋮ Graph unification and matching ⋮ Pragmatic and semantic aspects of a module concept for graph transformation systems ⋮ Hierarchically distributed graph transformation ⋮ Transformations of graph grammars ⋮ On categorical graph grammars integrating structural transformations and operations on labels ⋮ Algebraic approach to single-pushout graph transformation ⋮ Parallel and distributed derivations in the single-pushout approach ⋮ On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH ⋮ Pullback rewriting and applications ⋮ Basic Results for Two Types of High-Level Replacement Systems ⋮ The uniqueness condition for the double pushout transformation of algebras ⋮ Graph transformation through graph surfing in reaction systems ⋮ Adaptive star grammars and their languages ⋮ An overview of the K semantic framework ⋮ CoReS: a tool for computing core graphs via SAT/SMT solvers ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ On structured graph grammars. I ⋮ Pushout-complements and basic concepts of grammars in toposes ⋮ Amalgamation of graph transformations: a synchronization mechanism ⋮ Note on node-rewriting graph grammars ⋮ A general framework for types in graph rewriting ⋮ Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories ⋮ Bigraphs and Their Algebra ⋮ Code Generation for Parallel Applications Modelled with Object-Based Graph Grammars ⋮ Formal software specification with refinements and modules of typed graph transformation systems ⋮ String diagram rewrite theory III: Confluence with and without Frobenius
