Abstract
In this paper we show how trace theory can be used to describe the behaviour of "concurrent systems". We present a short introduction to trace theory. We also discuss a program notation that specifies the trace set of a component. As an example we derive a solution for one of the problems of the STC Workshop [5].
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
7. References
Rem, Martin; Snepscheut, Jan L.A. van de; Udding, Jan Tijmen. Trace theory and the definition of hierarchical components. In: Proceedings of the third Caltech Conference on VLSI. Computer Science Press 1983, pp 225–239.
Snepscheut, Jan L.A. van de. Deriving circuits from programs. In: Proceedings of the third Caltech Conference on VLSI. Computer Science Press, 1983, pp 241–256.
Snepscheut, Jan L.A. van de. Trace theory and VLSI design. Ph.D. thesis. Eindhoven University of Technology, 1983.
Udding, Jan Tijmen. On recursively defined sets of traces. Technical Note. Eindhoven University of Technology, Department of Mathematics and Computing Science, 1982.
Problem set for the workshop on the analysis of concurrent systems. In these proceedings.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaldewaij, A. (1985). Trace theory and the specification of concurrent systems. In: Denvir, B.T., Harwood, W.T., Jackson, M.I., Wray, M.J. (eds) The Analysis of Concurrent Systems. Lecture Notes in Computer Science, vol 207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16047-7_48
Download citation
DOI: https://doi.org/10.1007/3-540-16047-7_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16047-2
Online ISBN: 978-3-540-39731-1
eBook Packages: Springer Book Archive