search for books and compare prices
Tables of Contents for Handbook of Graph Grammars and Computing by Graph Transformations
Chapter/Section Title
Page #
Page Count
Preface
v
Graph Relabelling System and Distributed Algorithms
1
56
Igor Litovsky
Yves Metivier
Eric Sopena
Introduction
2
1
Graphs
3
1
First Examples
4
4
Sequential Computation of a Spanning Tree
4
2
Distributed Computation of a Spanning Tree Without Local Detection of the Global Termination
6
1
Distributed Computation of a Spanning Tree with Local Detection of the Global Termination
6
2
Graph Relabelling Systems
8
6
Labelled Graphs
8
1
Graph Relabelling Systems
8
2
Local Control Mechanisms
10
4
Proof Techniques
14
7
The Graph Relabelling System R1
15
2
The Graph Relabelling Systems with Priorities R2
17
2
The Graph Relabelling System with Forbidden Contexts R3
19
2
Local Computations
21
2
Definitions
21
1
Distributed Computations of Local Computations
22
1
Coverings and k-Coverings
23
7
Coverings
23
1
The Kronecker Product
26
1
k-Coverings
27
2
Local Computations and k-Coverings
29
1
The Election Problem
30
5
Examples
30
2
Election Without any Knowledge
32
1
Election Knowing the Size or the Topology
33
2
The Recognition Problem
35
12
Examples
37
1
Recognition Without any Knowledge
38
5
Recognition Knowing the Size
43
1
Double k-Covering Technique
43
2
Minors
45
1
Comparision with Logical Languages
45
2
The Termination Detection Problem
47
10
The Local Detection of the Global Termination
47
1
Applications of k-Coverings to Termination Detection
48
2
Quasi k-Coverings and Local Detection of Normal Forms: the Case of T-Prime Graphs
50
3
Comparision with Other Problems
53
1
Reference
54
3
Actor Grammars and Local Actions
57
50
D. Janssens
Introduction
58
1
Actor Grammars and ESM Systems
59
9
Actor Grammars
59
6
ESM Systems
65
3
Processes
68
18
Basic Principles
69
3
Static Structures
72
3
Local Operations
75
5
Dynamic Structures and Processes
80
2
The Computed Structure of a Process
82
4
The Semiring of Dynamic Structures
86
6
The Composition of Processes
92
1
Processes as Graph Transformations
93
5
Systems and Semantics
98
9
Productions and Systems
98
2
Building Processes from Productions
100
1
The Role of the Left-Hand Side
101
4
References
105
2
Concurrent Semantics of Algebraic Graph Transformations
107
82
Paolo Baldan
Andrea Corradini
Hartmut Ehrig
Michael Lowe
Ugo Montanari
Francesca Rossi
Introduction
109
5
Typed Graph Grammars in the DPO Approach
114
11
Relation with Petri Nets
122
3
Derivation Trace Semantics
125
9
Abstraction Equivalence and Abstract Derivations
125
4
Shift Equivalence and Derivation Traces
129
5
Process Semantics
134
13
Graph Process
135
8
Concatenable Graph Processes
143
4
Relating Derivation Traces and Processes
147
11
Characterization of the ctc-Equivalence
147
4
From Processes to Traces and Backwards
151
7
Event Structure Semantics
158
18
Prime Event Structures and Domains
159
2
Event Structures Semantics for a Grammar
161
10
Processes and Events
171
3
Adequateness of PES: Asymmetric Conflict in Graph Grammars
174
2
Related Work
176
13
References
180
5
Appendix
185
1
Construction of Canonical Graphs
185
4
Modeling Concurrent, Mobile and Coordinated Systems via Graph Transformations
189
80
Ugo Montanari
Macro Pistore
Francesca Rossi
Introduction
191
3
Graphs and Graph Rewriting
194
4
Constraints
198
4
Constraints in Artificial Intelligence
198
3
Constraints in Programming Languages
201
1
Application to Concurrent Constraint Programming
202
28
Concurrent Constraint Programming
205
2
The Operational Semantics
207
8
The Concurrent Semantics
215
5
An Example
220
10
Application to Distributed Systems
226
10
Graph Rewriting for Distributed Systems
230
3
Constraint Problems and Constraint Propagation
233
1
An Example
234
5
Advantages of our Approach
239
1
The π-Calculus
240
7
Concurrent Semantics for the π-Calculus
246
1
Application to the π-Calculus
247
16
Concurrent Operational Semantics
249
9
Abstract Concurrent Semantics
258
4
Concluding Remarks
262
1
Conclusions
263
6
References
264
5
Distributed Graph Transformation with Application to Visual Design of Distributed Systems
269
72
Ingrid Fischer
Manual Koch
Gabriele Taentzer
Victor Volle
Introduction
271
1
Specification and Design of Distributed Systems
272
5
Requirements of Distributed Systems
272
1
Formal Specification Techniques for Concurrent and Distributed Systems
273
3
Object-Oriented Modeling Techniques for Distributed Systems
276
1
Describing Distributed Systems
277
20
Informal Approach to Algebraic Graph Transformation
277
3
Concepts of Distributed Graph Transformation
280
17
Distributed Version Control
297
19
Problems of Software Configuration Management
297
1
Modeling Software Configuration Management with Distributed Graphs
298
3
Working with Workspaces
301
1
Introducing and Deleting Revision Archives
302
1
Introducing and Deleting Replication Directions
303
2
Replication Between Sites
305
2
Checking out a Configuration
307
3
Checking Back Into the Archive
310
4
Summary
314
2
Distributed Graphs and Graph Transformation
316
20
Attributed Graph Transformation
316
4
Attributed Application Conditions
320
2
Distributed Attributed Graph Transformation
322
11
Distributed Attributed Application Conditions
333
1
Local Views on a Distributed System
334
2
Conclusions
336
5
References
337
4
High-Level Replacement Systems Applied to Algebraic Specifications and Petri Nets
341
60
H. Ehrig
M. Gajewsky
F. Parisi-Presicce
Introduction
343
1
High-Level Replacement Systems
344
15
High-Level Replacement Systems
344
6
Local Church Rosser and Parallelisms Results
350
3
Horizontal Structuring
353
4
Further Results
357
2
Applications to Algebraic Specifications and System Design
359
23
Introduction to Algebraic Specifications
359
2
Categories of Algebraic Specifications and Their HLR Properties
361
7
Module Specifications
368
6
Rewriting as System Design
374
8
Applications to Petri Nets and Requirements Engineering
382
13
Introduction to Petri Nets
382
1
Categories of Petri Nets and Their HLR Properties
383
5
Requirements Engineering Using AHL-Nets
388
7
Conclusion
395
6
References
396
5
Describing Systems of Processes by Means of High-Level Replacement
401
50
H. J. Schneider
Introduction
403
2
Basic Notions
405
4
Comma Category Approach
409
3
Graphs and Labelled Graphs
412
4
Petri Nets
416
5
Statecharts
421
4
Parallel Logic Programming
425
6
Systems of Processes
431
8
Conclusion
439
4
References
440
3
Appendix
443
1
Full Example
443
7
List of Categories and Functors
450
1
Index
451