Specification of concurrent systems using graph grammars

Existing textual programming languages support sequential programming well because there is a correlation between the one-dimensional nature of text and the one-dimensional nature of sequential programs, i.e. the single flow of control in a program. Textual notation does not support concurrent programming as well, however, because concurrent programs have many threads of control, have a two-dimensional relationship between the flow of control in a process and the flow of information between processes, and are often dynamic. Most existing models for the specification of concurrent systems support one or two of these traits, but fall short of supporting all three.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Loyall, Joseph Patrick

Contributors dc:contributor

• Kaplan, Simon M.

• Computer Science

Statement dc:rights

• Copyright 1991 Loyall, Joseph Patrick

Language dc:language

eng

Identifier

AAI9210902
(UMI)AAI9210902

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/19683