Abstract
We introduce a mathematical model of the timed behaviour of components with streams as input and output using a hierarchy of timing concepts. We distinguish non-timed streams, discrete streams with discrete or with continuous time, and dense streams with continuous time. We introduce a notion of a timed system component and formulate requirements for the time flow. We show how to compose timed systems in a modular way. We show that the introduction of time into a system model as well as the change of the timing model in the system development process is a refinement step.
This work was partially sponsored by the Sonderforschungsbereich 342 “Werkzeuge und Methoden für die Nutzung paralleler Rechnerarchitekturen”, by the BMBF project KorSys, and the industrial research project SysLab.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur, D. Dill: A theory of timed automata. Theoretical Computer Science 126, 1994, 183–235
R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine: Agorithmic analysis of hybrid systems. Theoretical Computer Science 138, 1995, 3–34
J.C.M. Baeten, J.A. Bergstra: Real Time Process Algebra. Formal Aspects of Computing 3, 1991, 142–188
M. Broy: Applicative real time programming. In: Information Processing 83, IFIP World Congress, Paris 1983, North Holland Publ. Company 1983, 259–264
M. Broy: Functional Specification of Time Sensitive Communicating Systems. ACM Transactions on Software Engineering and Methodology 2:1, Januar 1993, 1–46
M. Broy, K. Stølen: Specification and Refinement of Finite Dataflow Networks — a Relational Approach. In: Langmaack, H. and de Roever, W.-P. and Vytopil, J. (eds): Proc. FTRTFT'94, Lecture Notes in Computer Science 863, 1994, 247–267
N. Lynch, E. Stark: A proof of the Kahn principle for input/output automata. Information and Computation 82, 1989, 81–92
N. A. Lynch, M. R. Tuttle: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, 1987
N. Lynch, F. Vaandrager: Action Transducers and Time Automata. Formal Aspects of Computing 8, 1996, 499–538
N. Lynch, F. Vaandrager: Forward and Backward Simulations, Part II: Timing-Based Systems. Information and Computation 128:1, 1996
O. Müller, P. Scholz: Functional Specification of Real-Time and Hybrid Systems. In HART'97, Proc. 1st Int Workshop on Hybrid and Real-Time Systems, to appear in LNCS, 1997
D. Park: On the semantics of fair parallelism. In: D. Björner (ed.): Abstract Software Specification. Lecture Notes in Computer Science 86, Berlin-Heidelberg-New York: Springer 1980, 504–526
D. Park: The “Fairness” Problem and Nondeterministic Computing Networks. Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, Mathematisch Centrum Amsterdam, (1983) 133–161
P. Pannangaden, V. Shanbhogue: The expressive power of indeterminate dataflow primitives. Information and Computation 98, 1992, 99–131
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broy, M. (1997). Refinement of Time. In: Bertran, M., Rus, T. (eds) Transformation-Based Reactive Systems Development. ARTS 1997. Lecture Notes in Computer Science, vol 1231. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63010-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-63010-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63010-4
Online ISBN: 978-3-540-69058-0
eBook Packages: Springer Book Archive