Polarized process algebra with reactive composition

Polarized processes are introduced to model the asymmetric interaction of systems. The asymmetry stems from the distinction between service and request. The scheduled concurrent composition of two polarized processes is called client-server composition or reactive composition, placing one process in the role of a client and the other process in the role of a server which is supposed to react on requests. The technical goal of this paper is to provide a definition of reactive composition for polarized processes and to prove that reactive composition thus defined is associative.

[1]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

[2]  Jan A. Bergstra,et al.  Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..

[3]  Jan A. Bergstra,et al.  Polarized Process Algebra and Program Equivalence , 2003, ICALP.

[4]  Henri E. Bal,et al.  Programming languages for distributed computing systems , 1989, CSUR.

[5]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[6]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[7]  Jan A. Bergstra,et al.  Thread algebra for strategic interleaving , 2007, Formal Aspects of Computing.

[8]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[9]  Alban Ponse.  Program algebra with unit instruction operators , 2002, J. Log. Algebraic Methods Program..

[10]  Robin Milner.  Functions as Processes , 1990, ICALP.

[11]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[12]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.