, Communication and Concurrency, International Series in Computer Science, 1989.
, A calculus of mobile processes, I and II, Information and Computation, a preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, pp.1-40, 1989.
, An object calculus for asynchronous communication, Proceedings of the European Conference on Object- Oriented Programming (ECOOP), pp.133-147, 1991.
DOI : 10.1007/BFb0057019
, Asynchrony and the ?-calculus (note), 1992.
, Decoding Choice Encodings, the Proceedings of CONCUR'96, pp.1-59, 2000.
DOI : 10.1006/inco.2000.2868
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.5996
, On bisimulations for the asynchronous ??-calculus, Proceedings of CONCUR '96, pp.291-324, 1998.
DOI : 10.1016/S0304-3975(97)00223-5
URL : https://hal.archives-ouvertes.fr/inria-00073784
, Comparing the expressive power of the synchronous and asynchronous $pi$ -calculi, POPL'97, pp.685-719, 2003.
DOI : 10.1017/S0960129503004043
URL : https://hal.archives-ouvertes.fr/inria-00201104
, What is a ???Good??? Encoding of Guarded Choice?, an extended abstract appeared in the Proceedings of EXPRESS'97, pp.287-319, 2000.
DOI : 10.1006/inco.1999.2822
, Pict: A programming language based on the picalculus, Proof, Language and Interaction: Essays in Honour of Robin Milner, pp.455-494, 1998.
, Bisimulations and divergence, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.202-241, 1990.
DOI : 10.1109/LICS.1988.5117
, Probabilistic Asynchronous ??-Calculus, Proceedings of FOSSACS 2000, pp.146-160, 2000.
DOI : 10.1007/3-540-46432-8_10
URL : http://arxiv.org/pdf/cs/0109002v1.pdf
, Probabilistic simulations for probabilistic processes, Proceedings of CONCUR '94, pp.250-273, 1995.
DOI : 10.1007/bfb0015027
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6430
, Testing equivalences for processes, Theoretical Computer Science, vol.34, issue.1-2, pp.83-133, 1984.
DOI : 10.1016/0304-3975(84)90113-0
, Testing Equivalence for Mobile Processes, Information and Computation, vol.120, issue.2, pp.279-303, 1995.
DOI : 10.1006/inco.1995.1114
URL : http://basics.sjtu.edu.cn/~yuehg/concur/testing equivalence for mobile processes 92.pdf
, Compositional testing preorders for probabilistic processes, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, pp.431-441, 1995.
DOI : 10.1109/LICS.1995.523277
, Probabilistic extensions of process algebras, Handbook of Process Algebras, pp.685-710, 2001.
, Testing probabilistic automata, Proceedings of CONCUR '96: Concurrency Theory, 7th International Conference, pp.299-314, 1996.
DOI : 10.1007/3-540-61604-7_62
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.6403
, A distributed protocol for channel-based communication with choice, Computers and Artificial Intelligence, vol.12, issue.5, pp.475-490, 1993.
DOI : 10.1007/3-540-55599-4_135
, Multiway synchronization verified with coupled simulation, CONCUR '92: 3rd International Conference on Concurrency Theory, pp.518-533, 1992.
DOI : 10.1007/BFb0084813
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.2496
, Fault-tolerant algorithms for fair interprocess synchronization, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.7, pp.737-748, 1994.
DOI : 10.1109/71.296319
, A distributed abstract data type implemented by a probabilistic communication scheme, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), pp.373-379, 1980.
DOI : 10.1109/SFCS.1980.2
, Real-Time Synchronization of Interprocess Communications, ACM Transactions on Programming Languages and Systems, vol.6, issue.2, pp.215-238, 1984.
DOI : 10.1145/2993.357244
, Strong interaction fairness via randomization, IEEE Transactions on Parallel and Distributed Systems, vol.9, issue.2, pp.137-149, 1998.
DOI : 10.1109/71.663873
, On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem A Classical Mind: Essays in Honour of C, an extended abstract appeared in the Proceedings of POPL'81, pp.333-352, 1994.
, A Randomized Distributed Encoding of the ??-Calculus with Mixed Choice, Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, pp.537-549, 2002.
DOI : 10.1007/978-0-387-35608-2_44
, ??-Calculus, internal mobility, and agent-passing calculi, Theoretical Computer Science, vol.167, issue.1-2, pp.235-274, 1996.
DOI : 10.1016/0304-3975(96)00075-8
URL : http://doi.org/10.1016/0304-3975(96)00075-8
, Modal logics for mobile processes, Theoretical Computer Science, vol.114, issue.1, pp.149-171, 1993.
DOI : 10.1016/0304-3975(93)90156-N
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.6980
, A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time, Theoretical Computer Science, vol.202, issue.1-2, pp.1-2, 1998.
DOI : 10.1016/S0304-3975(97)00127-8
, On the generalized dining philosophers problem, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, pp.81-89, 2001.
DOI : 10.1145/383962.383994
, of Cambridge tracts in theoretical computer science, Procesalgebra, 1990.
, CCS with priority guards, CONCUR: 12th International Conference on Concurrency Theory, pp.305-320, 2001.
, Randomized dining philosophers without fairness assumption, pp.65-76, 2004.
DOI : 10.1007/978-0-387-35608-2_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.1912
, Probabilistic Asynchronous ??-Calculus, 2002.
DOI : 10.1007/3-540-46432-8_10
URL : http://arxiv.org/pdf/cs/0109002v1.pdf
, On abstraction and the expressive power of programming languages, papers of the Conference on Theoretical Aspects of Computer Software (TACS '91), pp.141-163, 1991.
DOI : 10.1016/0167-6423(93)90004-9