Cantitate/Preț
Produs

Graph Transformation: Lecture Notes in Computer Science, cartea 12741

Editat de Fabio Gadducci, Timo Kehrer
en Limba Engleză Paperback – 18 iun 2021
This book constitutes the refereed proceedings of the 14th International Conference on Graph Transformation, ICGT 2021, which took place virtually during June 24-25, 2021. The 14 full papers and 2 tool papers presented in this book were carefully reviewed and selected from 26 submissions. They deal with the following topics: theoretical advances; application domains; and tool presentations.


Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 32299 lei  6-8 săpt.
  Springer – 18 iun 2021 32299 lei  6-8 săpt.
  Springer – 26 iun 2020 32482 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32299 lei

Preț vechi: 40374 lei
-20%

Puncte Express: 484

Preț estimativ în valută:
5711 6549$ 4936£

Carte tipărită la comandă

Livrare economică 28 aprilie-12 mai


Specificații

ISBN-13: 9783030789459
ISBN-10: 3030789454
Pagini: 316
Ilustrații: XII, 303 p. 64 illus., 10 illus. in color.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Theoretical Advances.- Concurrency Theorems for Non-linear Rewriting Theories.- A Generalized Concurrent Rule Construction for Double-Pushout Rewriting.- Transformations of Reaction Systems over Categories by means of Epi-Mono Factorization and Functors.- Graph Rewriting and Relabeling with PBPO+.- Incorrectness Logic for Graph Programs.- Powerful and NP-Complete: Hypergraph Lambek Grammars.- Evaluation Diversity for Graph Conditions.- Application Domains.- Host-Graph-Sensitive RETE Nets for Incremental Graph Pattern Matching.- Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars.- Nets with Mana: A Framework for Chemical Reaction Modelling.- A Case Study on the Graph-transformational Modeling and Analysis of Puzzles.- Interval Probabilistic Timed Graph Transformation Systems.- Verifying Graph Programs with Monadic Second-Order Logic.- On the Complexity of Simulating Probabilistic Timed Graph Transformation Systems.- Tool Presentations.- Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars.- GrapePress - A Computational Notebook for Graph Transformations.