Theory and Application of Graph Transformations 6th International Workshop, TAGT'98 Paderborn, Germany, November 16-20, 1998 Selected Papers /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ehrig, Hartmut (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Engels, Gregor (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Kreowski, Hans-Jörg (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rozenberg, Grzegorz (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1764
• Θέματα: Computers.; Discrete mathematics.; Mathematical logic.; Computer science-Mathematics.; Artificial intelligence.; Theory of Computation.; Discrete Mathematics.; Mathematical Logic and Formal Languages.; Symbolic and Algebraic Manipulation.; Artificial Intelligence.

Theareaofgraphtransformationoriginatedinthelate1960sunderthename "graph grammars" - the main motivation came from practical considerations concerning pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph transformat...

Πίνακας περιεχομένων:

• Graph Languages
• Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars
• Tree Languages Generated by Context-Free Graph Grammars
• Neighborhood Expansion Grammars
• Neighborhood-Preserving Node Replacements
• Graph Theory
• Complexity Issues in Switching of Graphs
• The Power of Local Computations in Graphs with Initial Knowledge
• Categorical Approaches
• Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
• Double-Pushout Approach with Injective Matching
• Node Replacement in Hypergraphs: Translating NCE Rewriting into the Pullback Approacht
• Pushout Complements for Arbitrary Partial Algebras
• Concurrency and Distribution
• Unfolding of Double-Pushout Graph Grammars is a Coreflection
• Local Views on Distributed Systems and Their Communication
• Dynamic Change Management by Distributed Graph Transformation: Towards Configurable Distributed Systems
• A Framework for NLC and ESM: Local Action Systems
• Artificial Intelligence
• Redundancy and Subsumption in High-Level Replacement Systems
• Knowledge Representation and Graph Transformation
• Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching
• Visual Languages
• Conceptual Model of the Graphical Editor GenGEd for the Visual Definition of Visual Languages
• From Formulae to Rewriting Systems
• Hypergraphs as a Uniform Diagram Representation Model
• Specification Concepts
• Story Diagrams: A New Graph Rewrite Language Based on the Unified Modeling Language and Java
• A Fully Abstract Model for Graph-Interpreted Temporal Logic
• More About Control Conditions for Transformation Units
• Integrity Constraints in the Multi-Paradigm Language PROGRES
• Modularity and Refinement
• A Framework for Adding Packages to Graph Transformation Approaches
• Refinements of Graph Transformation Systems via Rule Expressions
• Simple Modules for Grace
• UML Packages for PROgrammed Graph REwriting Systems
• Incremental Development of Safety Properties in Petri Net Transformations
• Software Engineering
• Using Graph Transformation Techniques for Integrating Information from the WWW
• A Model Making Automation Process (MMAP) Using a Graph Grammar Formalism
• Graph-Based Models for Managing Development Processes, Resources, and Products
• Deriving Software Performance Models from Architectural Patterns by Graph Transformations.