zbMath1095.68047MaRDI QIDQ2491953
Gabriele Taentzer, Ulrike Prange, Hartmut Ehrig, Karsten Ehrig
Publication date: 31 May 2006
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Multi-level Model Product Lines,
Incremental Concurrent Model Synchronization using Triple Graph Grammars,
Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming,
Towards Multiple Model Synchronization with Comprehensive Systems,
Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras,
Preserving consistency in geometric modeling with graph transformations,
On the Specification and Verification of Model Transformations,
Sesqui-Pushout Rewriting with Type Refinements,
On the Operationalization of Graph Queries with Generalized Discrimination Networks,
Recognizable languages of arrows and cospans,
Conditional Bigraphs,
Confluence up to Garbage,
Unfolding Symbolic Attributed Graph Grammars,
Single Pushout Rewriting in Comprehensive Systems,
Initial Conflicts for Transformation Rules with Nested Application Conditions,
Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics,
Graph Parsing as Graph Transformation,
Graph Consistency as a Graduated Property,
Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions,
Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic,
A Simulator for Probabilistic Timed Graph Transformation Systems with Complex Large-Scale Topologies,
Fundamentals of compositional rewriting theory,
A strict constrained superposition calculus for graphs,
Incidence hypergraphs: the categorical inconsistency of set-systems and a characterization of quiver exponentials,
Graph Transformation Units – An Overview,
Transformations in Reconfigurable Place/Transition Systems,
Explicit State Model Checking for Graph Grammars,
A Category of Surface-Embedded Graphs,
A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework,
Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic,
Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes,
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,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Unnamed Item,
Interacting quantum observables: categorical algebra and diagrammatics,
Embedding and Confluence of Graph Transformations with Negative Application Conditions,
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels,
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts,
Attributed Graph Constraints,
Resolution-Like Theorem Proving for High-Level Conditions,
Pattern-Based Model-to-Model Transformation,
Adaptive Star Grammars for Graph Models,
Tutorial Introduction to Graph Transformation,
Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions,
Behavior-Preserving Simulation-to-Animation Model and Rule Transformations,
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions,
A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams,
Open-graphs and monoidal theories,
Strong Joinability Analysis for Graph Transformation Systems in CHR,
Processes and unfoldings: concurrent computations in adhesive categories,
Finitary -adhesive categories,
RPO semantics for mobile ambients,
Multi-amalgamation of rules with application conditions in -adhesive categories,
-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation,
Combining termination proofs in model transformation systems,
Formal analysis of model transformations based on triple graph grammars,
Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions,
Evaluation diversity for graph conditions,
Application of Graph Transformation in Verification of Dynamic Systems,
Extended Triple Graph Grammars with Efficient and Compatible Graph Translators,
Controlling Reuse in Pattern-Based Model-to-Model Transformations,
CoReS: a tool for computing core graphs via SAT/SMT solvers,
A Logic of Graph Constraints,
A Formal Model for Organisational Structures behind Process-Aware Information Systems,
Model Transformation and Induced Instance Migration: A Universal Framework,
Van Kampen Colimits and Path Uniqueness,
On the Construction of Transformation Steps in the Category of Multiagent Systems,
Rule-Based Modeling and Static Analysis of Self-adaptive Systems by Graph Transformation,
Understanding and maintaining tactics graphically OR how we are learning that a diagram can be worth more than 10K LoC,
Rule Algebras for Adhesive Categories,
Theorem proving graph grammars with attributes and negative application conditions,
Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation,
Executing bigraphical reactive systems,
Towards Certifiable Implementation of Graph Transformation via Relation Categories,
Module integration using graph grammars (MIGRATE),
Fault trees on a diet: automated reduction by graph rewriting,
Modeling dynamic reconfigurations in Reo using high-level replacement systems,
Attributed graph transformation with node type inheritance,
Polymorphic Sesqui-Pushout Graph Rewriting,
Towards Local Confluence Analysis for Amalgamated Graph Transformation,
Multi-amalgamated Triple Graph Grammars,
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs,
Reachability in Graph Transformation Systems and Slice Languages,
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations,
Inductive Invariant Checking with Partial Negative Application Conditions,
Finite limits and anti-unification in substitution categories,
Constructing constraint-preserving interaction schemes in adhesive categories,
Towards ``mouldable code via nested code graph transformation, Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs, Specifying graph languages with type graphs, Multilevel coupled model transformations for precise and reusable definition of model behaviour, Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions, Unification of drags and confluence of drag rewriting, Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs, An inductive characterization of matching in binding bigraphs, Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes, A lattice-theoretical perspective on adhesive categories, How to delete categorically -- two pushout complement constructions, Symbolic graphs for attributed graph constraints, A categorical framework for the transformation of object-oriented systems: models and data, Accretive computation of global transformations, On blow-ups and injectivity of quivers, A formal approach to the specification and transformation of constraints in MDE, Graph transformation for incremental natural language analysis, Parallel rewriting of attributed graphs, Towards the flexible reuse of model transformations: a formal approach based on 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, Subobject transformation systems, Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach, Contextual hyperedge replacement, Monographs, a category of graph structures, Parallel coherent graph transformations, Encoding bigraphical reactive systems into graph transformation systems, From imperative to rule-based graph programs, Probabilistic timed graph transformation systems, A navigational logic for reasoning about graph properties, A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting, Algebraic graph rewriting with controlled embedding, Automating the transformation-based analysis of visual languages, Reasoning with graph constraints, Consistent integration of models based on views of meta models, An algebraic semantics for MOF, On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems, A formalisation of the copy-modify-merge approach to version control in MDE, Origami fold as algebraic graph rewriting, The Edge of Graph Transformation — Graphs for Behavioural Specification, Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation, Partial pushout semantics of generics in DOL, Well-structured graph transformation systems, A structural approach to graph transformation based on symmetric Petri nets, Synthesising CCS bisimulation using graph rewriting, A formalisation of deep metamodelling, A calculus of concurrent graph-rewriting processes, Compositional analysis of probabilistic timed graph transformation systems, Multi-valued logic in graph transformation theory and self-adaptive systems, A categorial approach to reaction systems: first steps, Confluence up to garbage in graph transformation, Single pushout rewriting in comprehensive systems of graph-like structures, Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality, Rewriting theory for the life sciences: a unifying theory of CTMC semantics, Comprehensive systems: a formal foundation for multi-model consistency management, Schema compliant consistency management via triple graph grammars and integer linear programming, Language family engineering with product lines of multi-level models, A tale of two graph models: a case study in wireless sensor networks, Prospects for declarative mathematical modeling of complex biological systems, Hybrid search plan generation for generalized graph pattern matching, Constructing optimized constraint-preserving application conditions for model transformation rules, Graphical reasoning in compact closed categories for quantum computation, Labelled port graph -- a formal structure for models and computations, Multiple model synchronization with multiary delta lenses with amendment and K-Putput, Function simulation, graph grammars and colourings, Composition of multilevel domain-specific modelling languages, A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications, Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions, Towards Algebraic High-Level Systems as Weak Adhesive HLR Categories, Connector Rewriting with High-Level Replacement Systems, Matching of Bigraphs, Simulation of Generalised Semi-Markov Processes based on Graph Transformation Systems, Termination Criteria for DPO Transformations with Injective Matches, Fibred amalgamation, descent data, and Van Kampen squares in topoi, Rule-based transformation of graph rewriting rules: towards higher-order graph grammars, Finding subgraphs with side constraints, Concurrency theorems for non-linear rewriting theories, A generalized concurrent rule construction for double-pushout rewriting, Transformations of reaction systems over categories by means of epi-mono factorization and functors, Graph rewriting and relabeling with PBPO\textsuperscript{+}, Evaluation diversity for graph conditions, Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars, Interval probabilistic timed graph transformation systems