Abstract
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This algebraic structure is shown to provide faithful interpretations of finitary process algebras, for an extension of the standard notion of testing semantics, leading to a model that is both denotational (in the sense that the internal workings of processes are ignored) and non-interleaving. Constructions on algebras and their subspaces enjoy a good structure that make them (nearly) a model of differential linear logic, showing that the underlying approach to the representation of non-determinism as linear combinations is the same.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference37 articles.
1. Abramsky S. , Jagadeesan R. and Malacaria P. (1994). Full abstraction for PCF. In: International Symposium on Theoretical Aspects of Computer Science (TACS), 1–15.
2. Symmetries, local names and dynamic (de)-allocation of names
3. An Algebraic Process Calculus
4. π-Calculus, internal mobility, and agent-passing calculi