The translation of processes into circuits

A. Kaldewaij

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationPARLE, Parallel Architectures and Languages Europe (Eindhoven, The Netherlands, June 15-19, 1987)
EditorsJ.W. Bakker, de, A.J. Nijman, P.C. Treleaven
Place of PublicationBerlin
PublisherSpringer
Pages195-212
Number of pages18
Volume1
ISBN (Electronic)978-3-540-47144-8
ISBN (Print)978-3-540-17943-6
DOIs
Publication statusPublished - 1987

Publication series

NameLecture Notes in Computer Science
Volume258
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'The translation of processes into circuits'. Together they form a unique fingerprint.

Cite this