Decidability of Equivalence for a Class of Data Flow Schemas
Name
MIT-LCS-TM-058.pdf
Size
6.81 MB
Format
Adobe PDF
Checksum (MD5)
f2cfc1c442c348c4906b17270d856b09
Author(s)
Qualitz, Joseph E.
Date Issued
March 1975
Series/Report no.
MIT-LCS-TM-058
MAC-TM-058
Abstract
In this paper we examine a class of computation schemas and consider the problem of deciding when pairs of elements in this class represent equivalent programs. We are able to show that equivalence is decidable for a non-trivial class of unary operator data flow schemas, and consider the applicability of this result to the problem of deciding equivalence in related models of computation. The model described below is a restricted version of the data flow schema described by Dennie and Fosseen in [1]. The reader is referred to that source for a more complete discussion of the properties of data flow schemas.
Persistent DSpace Link
