Selected papers of the Second Workshop on Concurrency and compositionality
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
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
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Proof, language, and interaction
Nordic Journal of Computing
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Concurrent Constraints in the Fusion Calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
On Asynchronous Communication Semantics
ECOOP '91 Proceedings of the Workshop on Object-Based Concurrent Computing
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Multiport interaction nets and concurrency
CONCUR 2005 - Concurrency Theory
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but uses no additional operators.