Abstraction and composition in Δ-specifications of concurrent systems

Authors:
Joseph P. Loyall;Simon M. Kaplan;Steven K. Goering
Affiliations:
TASC, Reading, MA;University of Illinois, Urbana, IL;CAS Medical Systems, Branford, CT
Venue:
IWSSD '91 Proceedings of the 6th international workshop on Software specification and design
Year:
1991

Citing 6
Cited 1

Specifying concurrent systems with &Dgr;-grammars

IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
A graph grammar approach to concurrent programming

A graph grammar approach to concurrent programming
Specification of concurrent systems using graph grammars

Specification of concurrent systems using graph grammars
An introduction to the NLC way of rewriting graphs

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Graph rewriting with unification and composition

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
The isomorphism problem is polynomially solvable for certain graph languages

Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science

Knowledge Representation and Reasoning in the Design of Composite Systems

IEEE Transactions on Software Engineering - Special issue on knowledge representation and reasoning in software development

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have been investigating the application of the Δ-grammar graph rewriting model to the problem of specifying concurrent systems. In this paper, we present abstraction and composition techniques for the Δ model and illustrate their use through examples.