E-Books durchsuchen

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<inline-formula><alternatives><math xmlns="http://www.w3.org/1998/Math/MathML"><msup><mrow></mrow><mo>+</mo></msup></math><tex-math>\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$^{+}$$\end{document}</tex-math><inline-graphic></inline-graphic></alternatives></inline-formula>

Incorrectness Logic for Graph Programs

Powerful and NP-Complete: Hypergraph Lambek Grammars

Evaluation Diversity for Graph Conditions

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

Automated Checking and Completion of Backward Confluence for Hyperedge Replacement Grammars

<italic>GrapePress</italic> - A Computational Notebook for Graph Transformations