Distributed Software Allocation with help
Node Label Controlled Graph Grammars

Preprint
(2003)

Author(s):  
      
L. Kotulski, kotulski(at)ii.uj.edu.pl 
      
       Jagiellonian University, Institute of Computer Science, Nawojki 11, 30-072 Cracow, Poland

Abstract. There is a real need for clear and sound design specification of distributed systems. A clear object model which provides an abstract and simplified, but consistent description of relevant aspects of a distributed object system can help to find common design problems and avoid wrong design decisions. In the paper a simple model of an allocation state a distributed object system is introduced and formally presentented with help of an attributed graph notation. 
The modification of the allocation is controlled by NLC class of grammar. We use here the algorithmic approach of instead, a more popular in concurrency, the algebraic one (where graph transformation based on graph morphism) because of its better computational complexity. Introduced aedNLC graph grammar solves parsing and membership problems with O(n2) computational complexity and support derivation of a new allocation graph with linear computational complexity. 

Pages: 25

Available Files:

preprint06.ps (905 K), preprint06.pdf (3 530 K)