Rewriting as a unified model of concurrency

The lecture given at the workshop was based on recent work published elsewhere [9, 10, 8, 7]. This abstract gives a brief description of the main results and ideas presented in that work, but does not provide any technical details; such details can be found in the papers mentioned above.

[1]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[2]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[3]  José Meseguer,et al.  Rewriting as a unified model of concurrency , 1990, OOPSLA/ECOOP '90.

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

[5]  José Meseguer,et al.  Conditional Rewriting Logic: Deduction, Models and Concurrency , 1990, CTRS.

[6]  Gul Agha,et al.  Concurrent programming using actors , 1987 .

[7]  José Meseguer,et al.  Petri nets are monoids: a new algebraic foundation for net theory , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[8]  José Meseguer,et al.  A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.