Graph Transformation, Specifications, and Nets

In Memory of Hartmut Ehrig

AvReiko Heckel,Gabriele Taentzer

Häftad, Engelska, 2018

Del 10800 i serien Lecture Notes in Computer Science

560 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2018-02-07
Mått:155 x 235 x 19 mm
Vikt:528 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:333
Förlag:Springer International Publishing AG
ISBN:9783319753959

Utforska kategorier

Programvaruutveckling inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.