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,wh ich 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 π-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.
|Original language||English (US)|
|Number of pages||17|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|State||Published - Jan 1 2002|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)