Results 1 
3 of
3
The πcalculus as a theory in linear logic: Preliminary results
 3rd Workshop on Extensions to Logic Programming, LNCS 660
, 1993
"... The agent expressions of the πcalculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of πcalculus (unlabeled) reduction is identified with “entailedby”. Under this translation, parallel composition is mapped to the multiplicative disjunct ..."
Abstract

Cited by 101 (17 self)
 Add to MetaCart
The agent expressions of the πcalculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of πcalculus (unlabeled) reduction is identified with “entailedby”. Under this translation, parallel composition is mapped to the multiplicative disjunct (“par”) and restriction is mapped to universal quantification. Prefixing, nondeterministic choice (+), replication (!), and the match guard are all represented using nonlogical constants, which are specified using a simple form of axiom, called here a process clause. These process clauses resemble Horn clauses except that they may have multiple conclusions; that is, their heads may be the par of atomic formulas. Such multiple conclusion clauses are used to axiomatize communications among agents. Given this translation, it is nature to ask to what extent proof theory can be used to understand the metatheory of the πcalculus. We present some preliminary results along this line for π0, the “propositional ” fragment of the πcalculus, which lacks restriction and value passing (π0 is a subset of CCS). Using ideas from prooftheory, we introduce coagents and show that they can specify some testing equivalences for π0. If negationasfailuretoprove is permitted as a coagent combinator, then testing equivalence based on coagents yields observational equivalence for π0. This latter result follows from observing that coagents directly represent formulas in the HennessyMilner modal logic. 1
OPUS: a Formal Approach to ObjectOrientation
, 1994
"... OPUS is an elementary calculus that models objectorientation. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
OPUS is an elementary calculus that models objectorientation.
The PiCalculus as a Theory in Linear Logic
, 1992
"... The agent expressions of the ßcalculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of ßcalculus (unlabeled) reduction is identified with "entailedby". Under this translation, parallel composition is mapped to the multiplicative disjunct ..."
Abstract
 Add to MetaCart
The agent expressions of the ßcalculus can be translated into a theory of linear logic in such a way that the reflective and transitive closure of ßcalculus (unlabeled) reduction is identified with "entailedby". Under this translation, parallel composition is mapped to the multiplicative disjunct ("par") and restriction is mapped to universal quantification. Prefixing, nondeterministic choice ( ), replication (!), and the match guard are all represented using nonlogical constants, which are specified using a simple form of axiom, called here a process clause. These process clauses resemble Horn clauses except that they may have multiple conclusions; that is, their heads may be the par of atomic formulas. Such multiple conclusion clauses are used to axiomatize communications among agents. Given this translation, it is nature to ask to what extent proof theory can be used to understand the metatheory of the picalculus. We present some preliminary results along this line for pi0, the ``propositional'' fragment of the picalculus, which lacks restriction and value passing (pi0 is a subset of CCS). Using ideas from prooftheory, we introduce coagents and show that they can specify some testing equivalences for pi0. If negationasfailuretoprove is permitted as a coagent combinator, then testing equivalence based on coagents yields observational equivalence for pi0. This latter result follows from observing that coagents directly represent formulas in the HennessyMilner modal logic.