Bisimulations in the join-calculus
Theoretical Computer Science
High-Level Petri Nets as Type Theories in the Join Calculus
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
The Join Calculus: A Language for Distributed Mobile Programming
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
On generic context lemmas for higher-order calculi with sharing
Theoretical Computer Science
Testing attribute-based transactions in SOC
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.01 |
The may and must-semantics are studied for the join-calculus. We provide a complete characterization of may-testing through a restricted set of contexts. The same characterization, up-to the basic observations, is also proved to be complete with respect to the must-testing semantics.