Abstract
A model of processes of transforming graphs is proposed in which concurrency and branching can be represented. Operations on structures representing processes of transforming graphs are defined that allow one to construct such structures from simple components and to characterize sets of processes of transforming graphs, including sets of processes generated by graph grammars.
Keywords
Get full access to this article
View all access options for this article.