An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories

  title={An Algebra of Graph Derivations Using Finite (co-) Limit Double Theories},
  author={Andrea Corradini and Martin Gro{\ss}e-Rhode and Reiko Heckel},
Graph transformation systems have been introduced for the formal specification of software systems. States are thereby modeled as graphs, and computations as graph derivations according to the rules of the specification. Operations on graph derivations provide means to reason about the distribution and composition of computations. In this paper we discuss the development of an algebra of graph derivations as a descriptive model of graph transformation systems. For that purpose we use a… 

Tile Transition Systems as Structured Coalgebras

The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side effects which are endowed with

From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence

Compositional SOS and beyond: a coalgebraic view of open systems

A Coalgebraic presentation of structured transition systems

A Temporal Logic Approach for Component Based System Specification and Reasoning

This language provides a new coarsegrained unit of modularisation, which, it is believed, allows one to better organise a system speci cation, and which admits the inclusion of (dynamic) recon guration operations.

A Bibliography of Papers in Lecture Notes in Computer Science ( 1999 ) , Part 2 of 2

(111)7x7 [501]. (k − 1) [1300]. 0/1 [237]. 012 [248]. 1 [1300]. 128 [1102]. 2 [1402, 1750, 1755, 493, 546, 1307, 910, 212, 239, 1113, 244, 1270, 873, 320, 874, 1602]. 2R [1782]. 3 [1620, 1537, 1291,

GETGRATS: A summary of scientific results (with annotated bibliography)

  • A. Corradini
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2001



Introduction to the Algebraic Theory of Graph Grammars (A Survey)

  • H. Ehrig
  • Computer Science
    Graph-Grammars and Their Application to Computer Science and Biology
  • 1978
The aim of this survey is to motivate and introduce the basic constructions and results which have been developed in the algebraic theory of graph grammars up to now, as well as applications to a "very small data base system", where consistent states are represented as graphs.

An inductive view of graph transformation

This paper provides an inductive description for graphs as arrows of a freely generated dgs-monoidal category and applies 2-categorical techniques, already known for term and term graph rewriting, to lay the basis for the orthogonal view.

A 2-Categorical Presentation of Term Graph Rewriting

The categorical framework is exploited to relate term graph rewriting and term rewriting, since gs-monoidal (2-)categories can be regarded as “weak” cartesian (2+) categories, where certain (2-naturality axioms have been dropped.

Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations

The double-pushout approach to graph transformation, which was invented in the early 1970's, is introduced in the Handbook of Graph Grammars and Computing by Graph.

A Categorial Model for Logic Programs: Indexed Monoidal Categories

The declarative view and the operational view of a logic program are reconciled in a highly formal framework, which provides interesting hints to possible generalizations of the logic programming paradigm.

Categorical concepts for parameterized partial specifications

Categorical constructions inherent to a theory of algebras with strict partial operations are presented and exploited to provide a categorical deduction calculus for conditional existence equations

Context-free graph grammars and concatenation of graphs

The class of context-free (or equational) graph languages, with respect to these two operations, is the class of graph languages generated by HR grammars.

Compositional Verification of Reactive Systems Specified by Graph Transformation

A loose semantics for graph transformation rules which has been developed recently is used in this paper for the compositional verification of specifications. The main conceptual tool here is the

A Categorical Manifesto

This paper tries to explain why and how category theory is useful in computing science, by giving guidelines for applying seven basic categorical concepts: category, functor, natural transformation,