DownloadThe Portobello Bookshop Gift Guide 2024

Handbook Of Graph Grammars And Computing By Graph Transformation - Volume 3: Concurrency, Parallelism, And Distribution

Hartmut Ehrig editor Ugo Montanari editor Grzegorz Rozenberg editor Hans-Jörg Kreowski editor

Format:Hardback

Publisher:World Scientific Publishing Co Pte Ltd

Published:1st Sep '99

Currently unavailable, our supplier has not provided us a restock date

Handbook Of Graph Grammars And Computing By Graph Transformation - Volume 3: Concurrency, Parallelism, And Distribution cover

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-for-applications 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.

ISBN: 9789810240219

Dimensions: unknown

Weight: unknown

472 pages