The translation of processes into circuits

  • Anne Kaldewaij
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 258)


A process is a pair 〈 A, X 〉 in which A is a set of symbols (the alphabet) and X is a non-empty prefix-closed subset of A* (the trace set). A process may be viewed as the specification of a mechanism:
  • -symbols correspond to events that may occur.

  • -traces correspond to sequences of events that may be observed when the mechanism is in operation.

In this paper we show how for a certain class of processes circuits can be derived that behave as prescribed by these processes. The circuits are delay-insensitive in the sense that their behaviour does not depend on delays in wires and switching elements.

Events may be initiated by a mechanism (active events) or by the environment of the mechanism (passive events). It is shown how active events can be transformed into passive events, and vice versa.

We show how the composition of processes corresponds to the composition of circuits.


State Graph Passive Event Program Text Original Circuit Handshaking Protocol 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [0]
    Hoare, C.A.R. Communicating Sequential Processes. Communications of the ACM 21 (1978); pp. 666–677.Google Scholar
  2. [1]
    Hoogerwoord, R.R. Some reflections on the implementation of trace structures. Computing Science Notes CS86/3. Department of Mathematics and Computing Science. Eindhoven University of Technology, 1986.Google Scholar
  3. [2]
    Kaldewaij, A. A Formalism for Concurrent Processes. Ph.D.-thesis. Eindhoven University of Technology, 1986.Google Scholar
  4. [3]
    Martin, Alain J. The Design of a Self-Timed Circuit for Distributed Mutual Exclusion. Proceedings 1985 Chapel Hill Conference on VLSI; ed H. Fuchs. Computer Science Press, Rockville, 1985; pp. 247–260.Google Scholar
  5. [4]
    Rem, Martin Concurrent Computations and VLSI Circuits. Control Flow and Data Flow: Concepts of Distributed Programming; ed. M. Broy. Springer, Berlin, 1985; pp. 399–437.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

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

Personalised recommendations