Linearity in Process Languages

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation.

• Type: Conference
• Year: 2002
• Where: LICS
• Authors: Mikkel Nygaard, Glynn Winskel
• Keywords: Automated Reasoning, LICS 2002, Mathematical Consequences, Open-map Bisimulation, Presumed Ability