G.N.Buckley and A.Silberschatz. An e#ective implementation for the generalized input-output of csp. ACM Transactions on Programming Languages and Systems, 5(2):223--235, April 1983. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
What is a `Good' Encoding of Guarded Choice? - Nestmann (1999) (Correct)
.... communication, as exemplified with Concurrent ML [Rep91] and Facile [TLK96] Despite Palamidessi s impossibility result, there also exist algorithms for the distributed implementation of such languages, and in particular of mixed choice, e.g. by Bernstein [Ber80] Buckley and Silberschatz [BS83] and Knabe [Kna93] which all have been proven although rather informally to be correct or, at least, to be deadlockfree. The question arises how these practically satisfactory implementations relate to Palamidessi s impossibility result. It is worthwhile to ask, whether the criteria of ....
....with respect to barbed and other bisimulations (5) Finally (6) we o#er some possible interpretations of our work. It has only recently (14 years after publication) turned out that the algorithm presented by Buckley and Silberschatz is not deadlock free [KS97] although otherwise stated [BS83]. This emphasizes the need for more formal analysis of distributed implementations and, in particular, of guarded choice. Note also that all of the previous encodings in Figure 1 satisfy Palamidessi s criteria, with one exception: the dotted arrow from # a to # a indicates that one of the ....
[Article contains additional citation context not shown here]
G. Buckley and A. Silberschatz. An E#ective Implementation for the Generalized Input-Output Construct of CSP. ACM Transactions on Programming Languages and Systems, 5(2):223--235, 1983.
Code Generation From Hierarchical Concurrency Specifications - Roegel, Smolka (2001) (Correct)
....in which placeholders are provided for the functional aspects of the system not fully captured in the original specification. The code generation algorithms and their implementations in the Concurrency Factory constitute new solutions to the well known input output guardscheduling problem [BS83,FR80] in the context of hierarchically configured concurrent systems. The Factory can produce either thread based Java code or distributed Ada 95 code. We thus address the code generation problem for both parallel, shared memory multiprocessor architectures, and for distributed platforms ....
....action # , and local channels in a network correspond to restricted pairs of complementary ports in CCS. 3 Scheduling Algorithm for Input Output Guards in Hierarchical Systems A faithful generation of code from VPL specifications requires that the input output guard scheduling problem [BS83,FR80] be solved. The solutions we propose are new variants of previously published solutions and are targeted toward hierarchically configured systems of concurrent processes. 5 type int 10 network n1( begin process p1(a: synch,b: synch) begin var x: int x: 0; while true do select a ....
G. N. Buckley and A. Silberschatz. An e#ective implementation for the generalized input-output construct of CSP. ACM Transactions on Programming Languages and Systems, 5(2):223--235, 1983.
Efficient Implementation of Multi-process Handshaking.. - Aspnas, Back.. (1989) (1 citation) (Correct)
....[Ekl] Bag87] and [Ram] all assume a fully connected point to point communication network, wheras [BaKu84b] BaHaKu85] assume a broadcasting network. The problems involved in implementing this mechanism are similar to the problem of implementing CSP with output guards, which has been studied in [BuSi83], Sis] BaEkKu] Bor] and [Bag86] The work in this paper is based on the broadcasting net implementations proposed in [BaKu84b] and [BaHaKu85] In [BaKu84b] and [BaKu88] a process is assumed to be able to cancel an attempt to broadcast a select message if it simultaneously receives a ....
Buckley, G.N. and Silberschatz, A., An e#ective implementation for the generalized input-output construct of CSP, ACM Trans. on Programming Languages, 5:2 (April 1983), pp. 223-235.
JACK: A process algebra implementation in Java - Freitas (2002) (Correct)
No context found.
G.N.Buckley and A.Silberschatz. An e#ective implementation for the generalized input-output of csp. ACM Transactions on Programming Languages and Systems, 5(2):223--235, April 1983.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC