By means of an example, we will present a description language for regular VLSI layouts. This language is a network calculus able to deal with recursive equations. These recursive equations can be understood as graph grammars. The solution of a recursive system of equations can be obtained by the iteration of a homomorphism of the net algebra. In a certain sense, the class of the layouts defined by a system of equations can also be understood as Lindenmayer-Rozenberg-system.
Key words computer-aided design - grammar types - hardware description languages - recursion schemes - very large scale integration