A theory of may testing for asynchronous calculi with locality and no name matching. (English) Zbl 1275.68106
Kirchner, Hélène (ed.) et al., Algebraic methodology and software technology. 9th international conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9–13, 2002. Prodeedings. Berlin: Springer (ISBN 3-540-44144-1/pbk). Lecture Notes in Computer Science 2422, 223-238 (2002).
Summary: We present a theory of may testing for asynchronous calculi with locality and no name matching. Locality is a non-interference property that is common in systems based on object-paradigm. Concurrent languages such as Join and Pict disallow name matching, which is akin to pointer comparison in imperative languages, to provide for an abstract semantics that would allow useful program transformations. May testing is widely acknowledged to be an effective notion for reasoning about safety properties. We provide a trace-based characterization of may testing for versions of asynchronous \(\pi \)-calculus with locality and no name matching, which greatly simplifies establishing equivalences between processes. We also exploit the characterization to provide a complete axiomatization for the finitary fragment of the calculi.
For the entire collection see [Zbl 1045.68011].
For the entire collection see [Zbl 1045.68011].
MSC:
| 68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
