Abstract
This paper is concerned with implementation of Communicating Reactive Processes(CRP), a new paradigm unifying capabilities of synchronous and asynchronous approaches to parallel programming. Synchronous languages like Esterel, Statecharts have features like instantaneous broadcasts, logical concurrency and determinism. Asynchronous languages, like ADA and CSP, allow physical concurrency and rendezvous communication mechanisms. CRP is designed for complex real-time process control applications requiring both forms of concurrency. CRP programs can be compiled into reactive nodes that communicate using rendezvous mechanism. Implementation of rendezvous is non trivial as the following constraints are to be satisfied: 1) mutual agreement over selection of a rendezvous required between the concerned processes, 2) the implementation has to be distributed with no single process knowing instantaneously global state. This problem has been solved for Hoare's CSP, but none of these solutions can be extended to CRP. The reason is that in CRP, an enabled rendezvous can be preempted by a local reaction. In this paper, we establish that there can not exist fully distributed implementation of CRP that allows complete autonomy to reactive nodes.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call