Paper Info
Title
Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars
Abstract
Non-sequential processes in graph grammars are introduced extending the repertoire of parallelism and concurrency known for graph grammar derivations. They are intended to describe the behaviour of systems explicitly where states or data may be distributed and actions may take place concurrently. Our notion of a process is liberal enough to include conflicts among actions so that it reflects potential activities rather than actual running of the system in general. The problem of detecting conflicts in a process is solved by a procedure transforming arbitrary conflicts into local and hence observable ones. For special situations conflict solutions are investigated by applying techniques and results from graph grammar theory.
Year
DOI
Venue
1986
10.1007/3-540-18771-5_64
Graph-Grammars and Their Application to Computer Science
Keywords
Field
DocType
graph grammar
Context-sensitive grammar,Rule-based machine translation,Tree-adjoining grammar,Programming language,Concurrency,Computer science,Theoretical computer science,Grammar,Graph rewriting,Clique-width,Graph (abstract data type)
Conference
ISBN
Citations 
PageRank 
3-540-18771-5
12
2.16
References 
Authors
9
2
Name
Order
Citations
PageRank
Hans-Jörg Kreowski11170251.39
Anne Wilharm2122.16