Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
B.Becker: “An easily testable optimal-time VLSI-multiplier” Proceedings of EUROMICRO 85, pp.401–411, Brussels, North-Holland.
H.Bühler: “Korrektheitsbeweise von rekursiv beschriebenen logisch-topologischen Netzen” Diplomarbeit, Saarbrücken 1986.
G.Hotz, B.Becker, R.Kolla, P.Molitor: “Ein logischer-topologischer Kalkül zur Konstruktion von integrierten Schaltkreisen” INFORMATIK: Forschung und Entwicklung, 1986, Heft 1 und 2, Springer Verlag 1986.
B.Becker, G.Hotz, R.Kolla, P.Molitor, H.G.Osthof: “CADIC: A System for Hierarchical Design of Integrated Circuits” TR07/1986, SFB124, Saarbrücken 1986.
B.Becker, G.Hotz, R.Kolla, P.Molitor, H.G.Osthof: “Hierarchical Design based on a Calculus of Nets” will appear in the Proceedings of the 24th Design Automation Conference, Miami 1987.
E. Clarke, Y. Feng: “ESCHER — A geometrical Layout System for Recursively Defined Circuits” CMU-CS-85-150, Carnegie-Mellon University, Pitsburgh 1985.
V.Claus: “Ebene Realisierungen von Schaltkreisen” Dissertation, Saarbrücken 1970.
G.Hotz: “Eine Algebraisierung des Syntheseproblems für Schaltkreise” EIK 1, 1965, pp.185–205, 209–231.
R.Kolla, P.Molitor: “A note on hierarchical layer-assignment” TR08/1986, SFB124, Saarbrücken 1986.
R.Kolla: “Über Fragen im Zusammenhang mit der Spezifikation und Expansion großer logisch topologischer Netze” Dissertation, Saarbrücken 1987.
R.Kolla: “Proving correctness of logic topological nets” will appear as technical report, SFB124, Saarbrücken 1987.
J. Messerschmidt: “Linguistische Datenverarbeitung mit COMSKEE” Stuttgart: B.G. Teubner 1984
P. Molitor: “Layer Assignment by Simulated Annealing” Microprocessing and Microprogramming 16 (1985), pp.345–350, North-Holland.
P.Molitor: “Über die Bikategorie der logisch topologischen Netze und ihre Semantik” Dissertation, Saarbrücken 1986.
P.Molitor: “Free Net Algebras in VLSI-Theory” in preparation, Saarbrücken 1987.
J. Sklansky: “Conditional-sum addition logic” IRE-EC 9, pp.226–231, 1960.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hotz, G., Kolla, R., Molitor, P. (1987). On network algebras and recursive equations. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1986. Lecture Notes in Computer Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18771-5_57
Download citation
DOI: https://doi.org/10.1007/3-540-18771-5_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18771-4
Online ISBN: 978-3-540-48178-2
eBook Packages: Springer Book Archive