Concurrent Pattern Calculus

Thomas Given-Wilson, Daniele Gorla and Barry Jay

Paper to appear in the 6th intern. IFIP conference on Theoreticaql Computer Science (IFIP-TCS 2010), Brisbane (Australia), September 20th-23rd, 2010.
Long version.

Abstract:

Concurrent pattern calculus drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. This provides a natural language for describing any form of exchange or trade. Many popular process calculi can be encoded in concurrent pattern calculi.

@InProceedings{GWGJ:IFIPTCS10,
  author    =   {T. Given-Wilson, D. Gorla and B. Jay},
  title     =   {Concurrent Pattern Calculus},
  editor    =   {C. Calude and V. Sassone},
  booktitle =   {Proc. of 6th International IFIP Conference on Theoretical Computer Science (IFIP-TCS 2010)},
  series    =   {},
  volume    = 	{},
  pages     =  	{},
  year      =  	{2010},
  publisher =   {Springer},
}