Specifying concurrent systems with Δ-grammars

Simon M. Kaplan, Steven K. Goering, Roy H. Campbell

Research output: Contribution to conferencePaper

Abstract

A graph-grammar-based notation for specifying concurrent and distributed systems is introduced. The notation has a formal algebraic basis that both defines the meanings of graphs and forms the foundation for verifying transformations from specifications to code. Specifications show no implementation bias and are therefore independent of many low-level issues that clutter up conventional notations. The use of graphics greatly simplifies the tasks of writing and understanding specifications of concurrent systems. The use of the approach is illustrated with two examples: the dynamic dining philosophers problem and the problem of establishing connections between clients in a multiple-server network with arbitrary topology in which the clients could be associated with any server.

Original languageEnglish (US)
Pages20-27
Number of pages8
DOIs
StatePublished - 1989
EventProceedings: Fifth International Workshop on Software Specification and Design - Pittsburgh, PA, USA
Duration: May 19 1989May 20 1989

Other

OtherProceedings: Fifth International Workshop on Software Specification and Design
CityPittsburgh, PA, USA
Period5/19/895/20/89

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Specifying concurrent systems with Δ-grammars'. Together they form a unique fingerprint.

  • Cite this

    Kaplan, S. M., Goering, S. K., & Campbell, R. H. (1989). Specifying concurrent systems with Δ-grammars. 20-27. Paper presented at Proceedings: Fifth International Workshop on Software Specification and Design, Pittsburgh, PA, USA, . https://doi.org/10.1145/75200.75203