We propose a core assembly language onto which process-calculi based languages may be compiled and present a specification for a self-contained abstract machine that runs this assembly code. We also include compilation examples of features of well known calculi and discuss possible optimizations. Finally, we report preliminary performance results obtained with an implementation of the abstract machine coupled with an experimental language based on the TyCO-calculus.
Keywords: Process-Calculi, Concurrency, Abstract-Machine,
(*) Departamento de Informática, Faculdade de Ciências da Universidade de Lisboa, Portugal.