Skip to main content
Conference Proceedings

Specifying concurrent languages and systems with Δ-grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 532 LNCS 475-489
DOI: 10.1007/BFb0017407
15Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper illustrates the use of graph grammars for specifying concurrent systems and languages. The model used in this paper, Δ-GRAMMARS, is rooted in existing graph grammar theory and provides a convenient framework in which to specify both static and dynamic concurrent systems. Our approach is illustrated by three examples.

Author supplied keywords

Cite

CITATION STYLE

APA

Kaplan, S. M., Loyall, J. P., & Goering, S. K. (1991). Specifying concurrent languages and systems with Δ-grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 532 LNCS, pp. 475–489). Springer Verlag. https://doi.org/10.1007/BFb0017407

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free