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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
