Central Library

Normal view MARC view ISBD view

Graph Transformation, Specifications, and Nets [electronic resource] : In Memory of Hartmut Ehrig / edited by Reiko Heckel, Gabriele Taentzer.

Contributor(s): Heckel, Reiko [editor.] | Taentzer, Gabriele [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 10800Publisher: Cham : Springer International Publishing : Imprint: Springer, 2018Edition: 1st ed. 2018.Description: XIV, 333 p. 106 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319753966.Subject(s): Computer graphics | Compilers (Computer programs) | Computer programming | Software engineering | Algorithms | Computer Graphics | Compilers and Interpreters | Programming Techniques | Software Engineering | AlgorithmsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 006.6 Online resources: Click here to access online
Contents:
On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches.- Integration of graph constraints into graph grammars.- Multi-view Consistency in UML.- A Simple Notion of Parallel Graph Transformation and its Perspectives.- A Tutorial on Graph Transformation.- Initial Conflicts and Dependencies: Critical Pairs Revisited.- Towards a Navigational Logic for Graphical Structures.- Model Transformations as Free Constructions.- The Verigraph Tool for Graph Transformation -- Decomposition Structures for Soft Constraint Evaluation Problems: an Algebraic Approach.- Overview of Recon gurable Petri Nets.- The Category "Undirected Graph".- Modular Termination of Graph Transformation.- Graph Attribution through Sub-Graphs.- On normal forms for structured speci cations with generating constraints -- Towards the Automated Generation of Consistent, Diverse, Scalable and Realistic Graph Models.- Graph Operations and Free Graph Algebras.
In: Springer Nature eBookSummary: This volume pays tribute to the scientific achievements of Hartmut Ehrig, who passed away in March 2016. The contributions represent a selection from a symposium, held in October 2016 at TU Berlin,  commemorating Hartmut' s life and work as well as other invited papers in the areas he was active in. These areas include Graph Transformation, Model Transformation,  Concurrency Theory, in particular Petri Nets, Algebraic Specification, and Category Theory in Computer Science.
    average rating: 0.0 (0 votes)
No physical items for this record

On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches.- Integration of graph constraints into graph grammars.- Multi-view Consistency in UML.- A Simple Notion of Parallel Graph Transformation and its Perspectives.- A Tutorial on Graph Transformation.- Initial Conflicts and Dependencies: Critical Pairs Revisited.- Towards a Navigational Logic for Graphical Structures.- Model Transformations as Free Constructions.- The Verigraph Tool for Graph Transformation -- Decomposition Structures for Soft Constraint Evaluation Problems: an Algebraic Approach.- Overview of Recon gurable Petri Nets.- The Category "Undirected Graph".- Modular Termination of Graph Transformation.- Graph Attribution through Sub-Graphs.- On normal forms for structured speci cations with generating constraints -- Towards the Automated Generation of Consistent, Diverse, Scalable and Realistic Graph Models.- Graph Operations and Free Graph Algebras.

This volume pays tribute to the scientific achievements of Hartmut Ehrig, who passed away in March 2016. The contributions represent a selection from a symposium, held in October 2016 at TU Berlin,  commemorating Hartmut' s life and work as well as other invited papers in the areas he was active in. These areas include Graph Transformation, Model Transformation,  Concurrency Theory, in particular Petri Nets, Algebraic Specification, and Category Theory in Computer Science.

There are no comments for this item.

Log in to your account to post a comment.