Social confluence in client-server systems
Source10th International Workshop on Computer Science Logic, CSL 1996, 5th Annual Conference of the European Association for Computer Science Logic, EACSL 1996
Google Scholar check
MetadataΕμφάνιση πλήρους εγγραφής
An extension to the theory of partial confluence of concurrent systems is presented in the setting of the polyadic π-calculus. The main result, expressed in terms of client-server systems, is that in certain client contexts, a member of a class of concurrent servers which may perform up to one state-changing internal action in determining the answer to a client's question is indistinguishable from a serial server. © Springer-Verlag Berlin Heidelberg 1997.