We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of such specifications, namely time independent specifications, weakly time dependent specifications and strongly time dependent specifications. Dataflow components are semantically modeled by sets of timed stream processing functions. Specifications describe such sets by logical formulas. We emphasize the treatment of the well-known fair merge problem and the Brock/Ackermann anomaly. We give refinement rules which allow specifications to be decomposed modulo a feedback operator.
CITATION STYLE
Broy, M., & Stφlen, K. (1994). Specification and refinement of finite dataflow networks — A relational approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 863 LNCS, pp. 247–267). Springer Verlag. https://doi.org/10.1007/3-540-58468-4_169
Mendeley helps you to discover research relevant for your work.