Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
An extensional fixed-point semantics for nondeterministic data flow
Kearney P., Staples J. (ed) Theoretical Computer Science91 (2):129-179,1991.Type:Article
Date Reviewed: Oct 1 1993

The authors describe a model of nondeterministic data flow that is abstracted from an underlying asynchronous deterministic behavior, thus representing nondeterminism resulting from a lack of information. For this construction of nondeterminism, a suitable deterministic framework is developed thoroughly.

A deterministic process is a continuous function mapping a history vector and an oracle sequence to an output history vector. Only special modeling processes fulfilling initializing and causality conditions on the input-output behavior are considered. The history vectors consist of a vector of streams of data items and “wait” items that will be discarded for the nondeterministic case. The introduced notion of behavioral equivalence of modeling processes is essentially based on the oracle sequences. In order to allow recursive definitions of processes and to construct networks of processes, a special class of operators on modeling functions is introduced. These modeling operators represent contexts for processes and are shown to preserve the modeling conditions and the behavioral equivalence of processes. A nondeterministic process is defined to be a behavior equivalence class of deterministic modeling processes of corresponding type. Operators on nondeterministic processes are defined accordingly. A main result is the extensionality of nondeterministic processes, that is, processes that have the same input-output relation in each context are equal. An alternative approach based on metric spaces is outlined briefly.

The paper is well organized and carefully written. The presentation is formal and contains all theoretical details. Most technical proofs are given in an appendix. Although a special approach is considered, the paper is self-contained. Related work is analyzed and compared. A good selection of references is also provided. The technical relevance of this work remains unclear.

Reviewer:  R. Wilhelm Review #: CR116132
Bookmark and Share
 
Data-Flow Languages (D.3.2 ... )
 
 
Semantics Of Programming Languages (F.3.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Data-Flow Languages": Date
DFL: a data flow language
Patnaik L., Bhattacharya P., Ganesh R. Information Systems 9(2): 97-106, 1984. Type: Article
Jul 1 1985
Towards a formal foundation for DeMarco data flow diagrams
Tse T., Pong L. The Computer Journal 32(1): 1-12, 1989. Type: Article
Oct 1 1990
A theory of regular MSC languages
Henriksen J., Mukund M., Kumar K., Sohoni M., Thiagarajan P. Information and Computation 202(1): 1-38, 2005. Type: Article
Apr 13 2006

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy