Advertisement

Trace theory and the specification of concurrent systems

  • Anne Kaldewaij
4. Solutions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 207)

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].

Keywords

Short Introduction Concurrent System Composition Function Outa Event Input Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [1]
    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.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    Snepscheut, Jan L.A. van de. Trace theory and VLSI design. Ph.D. thesis. Eindhoven University of Technology, 1983.Google Scholar
  4. [4]
    Udding, Jan Tijmen. On recursively defined sets of traces. Technical Note. Eindhoven University of Technology, Department of Mathematics and Computing Science, 1982.Google Scholar
  5. [5]
    Problem set for the workshop on the analysis of concurrent systems. In these proceedings.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Anne Kaldewaij
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyThe Netherlands

Personalised recommendations