TANENSAtM, A. Computer Networks. Prentice Hall, Englewood Cliffs, N.J.,  Home/Search   Document Not in Database   Summary   Related Articles

....the approach appears to be quite general and therefore could be used to obtain proof rules for other message passing statements, as well. In Section 2 we briefly review CSP and satisfaction proofs. In Section 3, proof rules for communications primitives of networks supporting unreliable datagrams [23] are derived. In Section 4, we consider communications primitives of networks that support reliable virtual circuits. Section 5 contains proof rules for rendezvous primitives and remote procedures. Finally, Section 6 discusses related work and Section 7 contains conclusions. 2. SYNCHRONOUS ....

....another could travel different routes and therefore might not arrive in the order sent. To mitigate these difficulties, each site in the network typically has software that converts such an unreliable datagram service into a facility that ensures that messages are delivered reliably and in order [23]. This network software can be viewed as a concurrent program, where processes synchronize and communicate using the unreliable datagram service. Hence the motivation for developing proof rules for messagepassing primitives discussed in this section. It is useful to distinguish between sent, ....

[Article contains additional citation context not shown here]

TANENSAtM, A. Computer Networks. Prentice Hall, Englewood Cliffs, N.J.,

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