Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic theory of processes
A proof of the Kahn principle for input/output automata
Information and Computation
A calculus of mobile processes, I
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A process algebraic view of input/output automata
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Testing equivalence for mobile processes
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
A calculus for cryptographic protocols
Information and Computation
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Linda-based applicative and imperative process algebras
Theoretical Computer Science
Communication and Concurrency
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
First-Order Axioms for Asynchrony
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd 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
Resource Based Models for Asynchrony
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Bisimulations in the join-calculus
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
A foundation for actor computation
Journal of Functional Programming
A fully abstract may testing semantics for concurrent objects
Theoretical Computer Science
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Global computing in a dynamic network of tuple spaces
Science of Computer Programming
Classification of security properties in a Linda-like process algebra
Science of Computer Programming - Special issue on security issues in coordination models, languages, and systems
Information and Computation
Basic observables for a calculus for global computing
Information and Computation
A Chart Semantics for the Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Asynchronous Nature of the Asynchronous Π-Calculus
Concurrency, Graphs and Models
Contract-Directed Synthesis of Simple Orchestrators
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Contract Compliance and Choreography Conformance in the Presence of Message Queues
Web Services and Formal Methods
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Automated Software Testing of Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Contract-based discovery of Web services modulo simple orchestrators
Theoretical Computer Science
A trace-based view on operating guidelines
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Linear-time and may-testing in a probabilistic reactive setting
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A fully abstract semantics for UML components
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
A fresh look at testing for asynchronous communication
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
We study trace and may-testing equivalences in the asynchronousversions of CCS and &pgr;-calculus. We start from theoperational definition of the may-testing preorder and providefinitary and fully abstract trace-based characterizations for it,along with a complete in-equational proof system. We also touchupon two variants of this theory by first considering a moredemanding equivalence notion (must-testing) and then a richerversion of asynchronous CCS. The results throw light on thedifference between synchronous and asynchronous communication andon the weaker testing power of asynchronous observations.