Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
| Hi-index | 0.00 |
The relative expressive power of global priorities against the local priorities induced by a best-matching communication paradigm is investigated. Two specific languages are taken as referential cases: FAP and COWS. FAP is a finite fragment of asynchronous CCS with explicit priorities. COWS is a process calculus with naming that was specifically devised for modelling the orchestration of web services and where best-matching serves the purpose of giving precedence to service instances over service definitions. Two main results are shown, one on the negative and the other on the positive side. First, we prove the impossibility of encoding FAP into COWS if the translation has to meet a few specific and reasonable requirements. Second, we define an encoding of FAP into COWS that does not respect the above requirements. We show however that it still possesses desirable properties.