Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic theory of processes
Algebraic theories for name-passing calculi
Information and Computation
Testing equivalence for mobile processes
Information and Computation
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
On Bisimulations for the Asynchronous pi-Calculus
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Asynchronous Observations of Processes
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
A Process Algebra Based on LINDA
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
A foundation for actor computation
Journal of Functional Programming
Encoding Asynchronous Interactions Using Open Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
The complexity of asynchronous model based testing
Theoretical Computer Science
| Hi-index | 0.00 |
Asynchronous communication mechanisms are usually a basic ingredient of distributed systems and protocols. For these systems, asynchronous may-based testing seems to be exactly what is needed to capture safety and certain security properties. We study may testing equivalence focusing on the asynchronous versions of CCS and π-calculus. We start from an operational testing preorder and provide finitary and fully abstract trace-based interpretations for it, together with complete inequational axiomatizations. The results throw light on the differences between synchronous and asynchronous systems and on the weaker testing power of asynchronous observations.