Relational algebra as formalism for hardware design

Berg ten, A.J.W.M. and Huijs, C. and Krol, Th. (1993) Relational algebra as formalism for hardware design. Microprocessing and Microprogramming, 38 (1-5). pp. 403-410. ISSN 0165-6074

Preview

PDF
619Kb

Abstract:	This paper introduces relational algebra as an elegant formalism to describe hardware behaviour. Hardware behaviour is modelled by functions that are represented by sets of tables. Relational algebra, developed for designing large and consistent databases is capable to operate on sets of tables and hence on sets of hardware behaviour functions. It pairs the advantages of formal design, such as verification and provable correct designs, to relative ease and simplicity of description. Descriptions tend to be directly mappable to hardware components such as PLA's. This in contrast to other, most predicate based, formal methods that create long and complex descriptions of hardware which make automated theorem provers a necessity for design tasks of practical sizes. Relational algebra can be applied for both combinatorial as sequential designs and also for transformations between designs. We demonstrate the power of this formalism by means of the Mealy to Moore transformation and show that it takes only a few operations.
Item Type:	Article
Copyright:	© 1993 Elsevier Science
Research Group:	Computer Architecture for Embedded Systems (CAES)
Link to this item:	http://purl.utwente.nl/publications/18064
Official URL:	http://dx.doi.org/10.1016/0165-6074(93)90174-J
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 118583