%T No Blocking on Yesterday\[rs]s Embedded CSP Implementation (the Rubber Band of Getting it Right and Simple)
%A  Øyvind Teig
%E Peter H. Welch,  Jon Kerridge,  Frederick R. M. Barnes
%B Communicating Process Architectures 2006
%X This article is a follow\-up after the paper \[dq]From
   message queue to ready queue\[dq], presented at the ERCIM
   Workshop last year. A (mostly) synchronous layer had been
   implemented on top of an existing asynchronous run\-time
   system. After that workshop, we discovered that the initial
   implementation contained two errors: both concerning
   malignant process rescheduling associated with timers and
   \[rs]reuse\[rs] of the input side of a channel. Also, the
   set of process/dataflow patterns was not sufficient. To keep
   complexity low, we have made two new patterns to reflect
   better the semantic needs inherent in the application. Our
   assumption of correctness is also, this time, based both on
   heuristics and \[rs]white\-board reasoning\[rs]. However,
   both the previous and this paper have been produced before
   any first shipment of the product, and well within
   full\-scale testing. Our solutions and way of attacking the
   problems have been in an industrial tradition.