Atjaunināt sīkdatņu piekrišanu

Graph Transformation: 14th International Conference, ICGT 2021, Held as Part of STAF 2021, Virtual Event, June 2425, 2021, Proceedings 1st ed. 2021 [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 303 pages, height x width: 235x155 mm, weight: 486 g, 10 Illustrations, color; 54 Illustrations, black and white; XII, 303 p. 64 illus., 10 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 12741
  • Izdošanas datums: 18-Jun-2021
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030789454
  • ISBN-13: 9783030789459
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 303 pages, height x width: 235x155 mm, weight: 486 g, 10 Illustrations, color; 54 Illustrations, black and white; XII, 303 p. 64 illus., 10 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 12741
  • Izdošanas datums: 18-Jun-2021
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030789454
  • ISBN-13: 9783030789459
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.


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.