Specifying concurrent systems with Δ-grammars

Abstract

Specificationof parallel and distributed systems is difficult because it involves describing a two dimensional relationship between the flow of control of many processes and the synchronized flow of data between those processes. Many re-

An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems

“…Graph-based formalisms for dynamic reconfiguration include graph grammars, such as Graph Abstractions for Concurrent Programming (GARP) [KK88] and ∆-grammars [KGC89], rewriting systems, such as the Chemical Abstract Machine (CHAM) [BB92] and Maude [MAU15], and formalisms based on category theory, such as Reo [KMLA11] and CommUnity [WLF01]. GARP models a system as a directed graph, in which named vertices (termed agents) represent tasks that communicate asynchronously by message passing through ports.…”

Graph Algorithm Animation with Grrr

“…Previous graph rewriting languages include GOOD [15], Progres [18], Dactl /MONSTR [7,1] and ∆-grammar programming [11], each of which has a unique interpretation of programming with graph rewrites. These graph rewriting languages vary in several important aspects: the type of host graph that is to be rewritten may be any graph, or it may be restricted by disallowing duplicate nodes or arcs, or indeed may have some underlying hierarchical structure; the graph may be rewritten in a serial or parallel manner; the transformations may be initiated in a number of ways; the transformations may be applied in serial or parallel; and there are alternative ways that the user can specify the transformations.…”

A Demonstration of the Grrr Graph Rewriting Programming Language

“…Other graph rewriting systems use different variants on the graph rewriting method, and visualise programs and graphs in alternative ways. Examples of such systems are Good [3], Progres [7], MONSTR [1] and ∆-grammar programming [2].…”