Abstract
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.
This work is supported by the Sonderforschungsbereich 342 “Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abadi, M., Lamport, L.: The Existence of Refinement Mappings. Tech. Report 29, Digital, Palo Alto, (1988)
Brock, J. D., Ackermann, W. B.: Scenarios: A Model of Non-determinate Computation. Proc. Formalization of Programming Concepts, LNCS 107, (1981) 252–259
Broy, M.: Towards a Design Methodology for Distributed Systems. Proc. Constructive Methods in Computing Science, Springer, (1989) 311–364
Broy, M.: Functional Specification of Time Sensitive Communicating Systems. Proc. Programming and Mathematical Method, Springer, (1992) 325–367
Broy, M., Dederichs, F., Dendorfer, C., Fuchs, M., Gritzner, T. F., Weber, R.: The Design of Distributed Systems — An Introduction to Focus. Tech. Report SFB 342/2/92 A, TU München (1992)
Broy, M., StØlen, K.: Specification and Refinement of Finite Dataflow Networks — a Relational Approach. Tech. Report SFB 342/7/94 A, TU München (1994)
Keller, R. M.: Denotational Models for Parallel Programs with Indeterminate Operators. Proc. Formal Description of Programming Concepts, North-Holland, (1978) 337–366
Kleene, S. C.: Introduction to Metamathematics. (1952)
Park, D.: The “Fairness” Problem and Nondeterministic Computing Networks. Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, Mathematisch Centrum Amsterdam, (1983) 133–161
StØlen, K., Dederichs, F., Weber, R.: Assumption/Commitment Rules for Networks of Asynchronously Communicating Agents. Tech. Report SFB 342/2/93 A, TU München (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broy, M., StØlen, K. (1994). Specification and refinement of finite dataflow networks — a relational approach. In: Langmaack, H., de Roever, WP., Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT ProCoS 1994 1994. Lecture Notes in Computer Science, vol 863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58468-4_169
Download citation
DOI: https://doi.org/10.1007/3-540-58468-4_169
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58468-1
Online ISBN: 978-3-540-48984-9
eBook Packages: Springer Book Archive