Abstract Claims Description Full Text

Abstract

Computer-controlled test and measurement systems, including resources having multiple states and resources having multiple inputs, are modeled as data flow diagrams of topologically interconnected resources. A set of "tasks" are defined for changing the states of multiple-state resources and causing software resources to produce output data. Methods and apparatus, including internal and external task ordering rules, are provided to automatically interleave such tasks and implement input-ordering restrictions. Thereby, a sequence of tasks is produced to control the systems so as to assure valid data collection and protect physical resources from abuse. Data structures are illustrated for implementing the invention in an object-oriented programming environment.

Other References

• Berztiss, A. T., Data Structures Theory and Practice, 1971, Academic Press, Inc., pp. 223-231
• Dennis, Jack B., "Models of Data Flow Computation," IEEE Computer Society CompCon 1984, pp. 346-354
• French, S., Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood Limited, 1982, Chapter 12, pp. 193-198
• Gottlieb, C. C. and Gottlieb, L. R., Data Types and Structures, Prentice-Hall, 1978, pp. 275-278
• Hughes, J. "A High-Level Representation for Implementing Control-Flow Structures in Dataflow Programs," Center for Reliable Computing, Computer Systems Laboratory, Stanford University (CSL Technical Report No. 84-2, May 1982)
• Dennis, J. B., Broy, M., "Control Flow and Data Flow: Concepts of Distributed Programming," Proceedings of NATO Advanced Study Institute International Summer School, Marktoberdorf, Germany, 1984, at 345-98
• Signal Processing WorkSystem™ Technical Backgrounder, Tektronix CAE Systems Division, 1987
• Knuth, Donald E., Fundamental Algorithms, Addison-Wesley, 1973, p. 258
• LabView Manual, National Instruments, Inc., Appendix A., 198