Communication and concurrency
A calculus of mobile processes, I
Information and Computation
Algebraic theories for name-passing calculi
Information and Computation
Testing equivalence for mobile processes
Information and Computation
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Resource access control in systems of mobile agents
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Complete inference systems for weak bisimulation equivalences in the π-calculus
Information and Computation
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Typed behavioural equivalences for processes in the presence of subtyping
Mathematical Structures in Computer Science
Typed polyadic pi-calculus in bigraphs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Hi-index | 0.00 |
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a channel, to write to a channel, and both to read and to write. They also give rise to a natural and powerful subtyping relation.Two variants of typed bisimilarity are considered, both in their late and in their early version. For both of them, proof systems that are sound and complete on the closed finite terms are given. For one of the two variants, a complete axiomatisation for the open finite terms is also presented.