The Compilation of Regular Expressions into Integrated Circuits
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
On the composition of processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The specification of process synchronization by path expressions
Operating Systems, Proceedings of an International Symposium
Area-efficient vlsi computation
Area-efficient vlsi computation
Specialized silicon compilers for language recognition
Specialized silicon compilers for language recognition
The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
Path expressions were originally proposed by Campbell and Habermann [1] as a mechanism for process synchronization at the monitor level in software. Not unexpectedly, they also provide a useful notation for specifying the behavior of asynchronous circuits. Motivated by this potential application we investigate how to directly translate path expressions into hardware.Our implementation is complicated in the case of multiple path expressions by the need for synchronization on event names that are common to more than one path. Moreover, since events are inherently asynchronous in our model, all of our circuits must be self-timed.Nevertheless, the circuits produced by our construction have area proportional to N log(N) where N is the total length of the multiple path expression under consideration. This bound holds regardless of the number of individual paths or the degree of synchronization between paths.