Speci cation and Re nement of Finite Data ow Networks a Relational Approach
نویسنده
چکیده
We specify the black box behavior of data ow components by characterizing the relation between the input and the output histories We distinguish between three main classes of such speci cations namely time independent speci cations weakly time dependent speci cations and strongly time dependent speci cations Data ow components are semantically modeled by sets of timed stream processing functions Speci cations describe such sets by logical formulas We emphasize the treatment of the well known fair merge problem and the Brock Ackermann anomaly We give re nement rules which allow speci cations to be decomposed into networks of speci cations
منابع مشابه
Compositional Re nement of Interactive Systems
We describe systems and their components by functional speci cation techniques We de ne notions of interface and interaction re nement for interactive systems and their components These notions of re nement allow one to change both the syntactic the number of channels and sorts of messages at the channels and the semantic interface causality ow between messages and interaction granularity of an...
متن کاملSpeci � cation and Re � nement of Networks of Asynchronously Communicating Agents
This paper presents an assumption commitment speci cation tech nique and a re nement calculus for networks of agents communicating asyn chronously via unbounded FIFO channels in the tradition of Kahn We de ne two types of assumption commitment speci cations namely simple and general speci cations It is shown that semantically any deterministic agent can be uniquely char acterized by a simple sp...
متن کاملTransformations in High-level Synthesis: Formal Speciication and Eecient Mechanical Veriication
Dependency graphs are used to model data and control ow in hardware and software design. In high-level synthesis of hardware, optimization and re nement transformations are used to transform dependency-graph-based speci cations at the behavior level to dependency-graph-based implementations at the register-transfer level. Registertransfer-level implementations are mapped to gate-level hardware ...
متن کاملAssume-guarantee Reenement between Diierent Time Scales ??? ?
Re nement checking is used to verify implementations against more abstract speci cations. Assume-guarantee reasoning is used to decompose re nement proofs in order to avoid state-space explosion. In previous approaches, speci cations are forced to operate on the same time scale as the implementation. This may lead to unnatural speci cations and ine ciencies in veri cation. We introduce a novel ...
متن کاملConsistency and re nement for partial speci cation in
This paper discusses theoretical background for the use of Z as a language for partial speci cation in particular techniques for check ing consistency between viewpoint speci cations The main technique used is uni cation i e nding a candidate least common re nement The corresponding notion of consistency between speci cations turns out to be di erent from the known notions of consistency for si...
متن کامل