图文法及图像转换计算手册，卷三：共点、平行及分布HANDBOOK OF GRAPH GRAMMARS AND COMPUTING BY GRAPH TRANSFORMATIONS,
点此进入淘宝搜索页搜索分类: 图书,进口原版书,科学与技术 Science & Techology ,
作者： H.EHRIG 著
出 版 社： Penguin
出版时间： 1999-12-1字数：版次： 1页数： 455印刷时间： 1999/10/01开本：印次： 1纸张： 胶版纸I S B N ： 9789810240219包装： 精装内容简介
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.
The area of graph grammars and graph transformations generalizes formal language theory based on strings and the theory of term rewriting based on trees. As a matter of fact, within the area of graph grammars, graph transformation is considered as a fundamental computation paradigm where computation includes specification, programming, and implementation. Over the last three decades, graph grammars have developed at a steady pace into a theoretically attractive and important杅or朼pplications research field.
Volume 3 of the indispensable Handbook of Graph Grammars and Computing by Graph Transformations presents the research on concurrency, parallelism, and distribution ?important paradigms of modern computer science. The topics considered include semantics for concurrent systems, modeling of concurrency, mobile and coordinated systems, algebraic specifications, Petri nets, visual design of distributed systems, and distributed algorithms. The contributions have been written in a tutorial/survey style by the top experts.
目录
Preface
1 Graph Relabelling Systems and Distributed Algorithms （I Litovsky et al.）
1.1 Introduction
1.2 Graphs
1.3 First Examples
1.3.1 Sequential Computation OF a Spanning Tree
1.3.2 Distributed Computation OF a Spanning Tree Without Local Detection OF the Global Termination
1.3.3 Distributed Computation OF a Spanning Tree With Lo-cal Detection of the Global Termination
1.4 Graph Relabelling Systems
1.4.1 Labelled Graphs
1.4.2 Graphs Relabelling Systems
1.4.3 Local Control Mechanisms
1.5 Proof Techniques
1.5.1 The Graph Relabelling System R1
1.5.2 The Graph Relabelling System with Priorities R2
1.5.3 The Graph Relabelling System with Forbidden Con-texts R3
1.6 Local Comprtations
1.6.1 Definions
1.6.2 Definions Comprtations of Local Comprtations
1.7 Coverings and K-Coverings
1.7.1 Coverings and K-Coverings
1.7.2 The Kronecker Product
1.7.3 K-Coverings
1.7.4 Local Computations and K-Coverings
1.8 The Election Problem
1.8.1 Examples
1.8.2 Election Without any Knowledge
1.8.3 Election Knowledge the Size or the Topology
1.9 The Recognition Problem
1.9.1 Examples
1.9.2 Recognition Without any Knowledgy
1.9.3 Recognition knowing the size
1.9.4 Double k-Covering Technique
1.9.5 Minors
1.9.6 Comparison with Logical Languages
1.10 The Termination Detection Problem
1.10.1 The Local Detection of the Global Termination
1.10.2 Applications of K-Coverings to Termination Detection
1.10.3 Quasi k-Coverings and Local Detection OF Normal Forms:the Case of T-Prime Graphs
1.10.4 Comparison with Other Problems
References
2 Actor Grammars and Local Actions （D Janssens）
2.1 Introduction
2.2 Actir Grammars and ESM Systems
2.2.1 Actor Grammars and ESM Systems
2.2.2 ESM Systems
2.3 Processes
2.3.1 Basic Primciples
2.3.2 Statoc Structures
2.3.3 Local Operations
2.3.4 Dynamic Structure and Processes
2.3.5 The Computed Structure OF a Process
……
3 Concurrent Semantics of Algebraic Graph Transformations （P Baldan et al.）
4 Modeling Concurrent, Mobile and Coordinated Systems via Graph 5 Transformations （U Montanari et al.）
6 Distributed Graph Transformation with Application to Visual 7 Design of Distributed Systems （I Fischer et al.）
8 High-Level Replacement Systems Applied to Algebraic 9 Specifications and Petri Nets （H Ehrig et al.）
10 Describing Systems of Processes by Means of High-Level 11 Replacement （H J Schneider）
