Graph Transformations in Computer Science (häftad)
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
404
Utgivningsdatum
1994-03-01
Upplaga
1994 ed.
Förlag
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Medarbetare
Schneider, H. J. (ed.), Ehrig, Hartmut (ed.)
Illustrationer
VIII, 404 p.
Dimensioner
234 x 156 x 22 mm
Vikt
581 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783540577874
Graph Transformations in Computer Science (häftad)

Graph Transformations in Computer Science

International Workshop, Dagstuhl Castle, Germany, January 4 - 8, 1993. Proceedings

Häftad Engelska, 1994-03-01
1099
Skickas inom 10-15 vardagar.
Fri frakt inom Sverige för privatpersoner.
The research area of graph grammars and graph transformations dates back only two decades. But already methods and results from the area of graph transformation have been applied in many fields of computer science, such as formal language theory, pattern recognition and generation, compiler construction, software engineering, concurrent and distributed systems modelling, and database design and theory. This volume contains 24 selected and revised papers from an international seminar held in Dagstuhl, Germany, in 1993. The papers cover topics in the following areas: foundations of graph grammars and transformations; and applications of graph transformations to concurrent computing, specification and programming, and pattern generation and recognition.
Visa hela texten

Passar bra ihop

  1. Graph Transformations in Computer Science
  2. +
  3. Formal and Natural Computing

De som köpt den här boken har ofta också köpt Formal and Natural Computing av Wilfried Brauer, Hartmut Ehrig, Juhani Karhumaki, Arto K Salomaa (häftad).

Köp båda 2 för 2238 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Innehållsförteckning

Path-controlled graph grammars for multiresolution image processing and analysis.- Syntax and semantics of hybrid database languages.- Decomposability helps for deciding logics of knowledge and belief.- Extending graph rewriting with copying.- Graph-grammar semantics of a higher-order programming language for distributed systems.- Abstract graph derivations in the double pushout approach.- Note on standard representation of graphs and graph derivations.- Jungle rewriting: An abstract description of a lazy narrowing machine.- Recognizable sets of graphs of bounded tree-width.- Canonical derivations for high-level replacement systems.- A computational model for generic graph functions.- Graphs and designing.- ESM systems and the composition of their computations.- Relational structures and their partial morphisms in view of single pushout rewriting.- 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.- Contextual occurrence nets and concurrent constraint programming.- Uniform-modelling in graph grammar specifications.- Set-theoretic graph rewriting.- On relating rewriting systems and graph grammars to event structures.- Logic based structure rewriting systems.- Guaranteeing safe destructive updates through a type system with uniqueness information for graphs.- Amalgamated graph transformations and their use for specifying AGG - an algebraic graph grammar system.