Sciweavers

Share
FTRTFT
1994
Springer

Specification and Refinement of Finite Dataflow Networks - a Relational Approach

12 years 11 days ago
Specification and Refinement of Finite Dataflow Networks - a Relational Approach
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.
Manfred Broy, Ketil Stølen
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1994
Where FTRTFT
Authors Manfred Broy, Ketil Stølen
Comments (0)
books