A Process Algebraic View of Linear Logic

In this paper we present a process algebra where the combi-nators are borrowed from linear logic. The principal idea is to present a direct operational semantics for O. The approach considers two sets of actions (input and output) and a merge operation which describes the synchronisation of processes. We then present a few results satissed by the bisimulation relation induced by the labelled transition system.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Glynn Winskel,et al.  Completeness Results for Linear Logic on Petri Nets , 1993, Ann. Pure Appl. Log..

[3]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[4]  Vladimir Alexiev,et al.  Applications of Linear Logic to Computation: An Overview , 1994, Log. J. IGPL.

[5]  Jean-Yves Girard,et al.  Linear logic: its syntax and semantics , 1995 .