Local states in distributed computations: a few relations and formulas.
ACM Operating Systems Review, 28(2):65-72, 1994.
(With E. Fromentin).

Déterminer un état global dans un système réparti.
Annales des télécommunications, 49(7-8):460-469, 1994.
(With J.M. Hélary and A. Mostefaoui).

A General Scheme for Token and Tree Based Distributed Mutual Exclusion Algorithms.
IEEE Transactions on Parallel and Distributed Systems,
5(11):1185-1196, 1994.
(With J.M. Hélary and A.Mostefaoui).

Towards the Construction of Distributed Detection Programs with an Application to Distributed Termination.
Distributed Computing, 7(3):137-147, 1994.
(With J.M. Hélary).

Protocoles simples pour l'implémentation répartie des sémaphores.
Annales des Télécommunications, vol.48(5-6): 260-267, 1993.

A debugging tool for distributed Estelle programs.
Journal of Computer Communications, 16(5):328-333, 1993.
(with Hurfin M. and Plouzeau N.).

About logical clocks for distributed systems.
ACM Operating Systems Review, 26(1):41-48, 1992.

The causal ordering abstraction and a simple way to implement it.
Information Processing Letters, 39:343-351, 1991.
(with Schiper A. and Toueg S.).

A simple taxonomy for distributed mutual exclusion algorithms.
ACM Operating Systems Review, 25(1):47-51, 1991.

Vers la construction raisonnée d'algorithmes répartis, le cas de la terminaison.
TSI, 10(3):203-209, 1991.
(With J.M. Hélary).

Simulation répartie : schémas d'exécution pour un modèle à processus.
TSI, 9(5):383-398, 1990.
(With Ph. Ingels).

Prime numbers as a tool to design distributed algorithms.
Information Processing Letters, vol.33(1):53-58, 1989.

Un schéma abstrait d'itération répartie,
application au calcul des chemins de valeurs minimales.
TSI, 8(3):259-268, 1989.
(With J.M. Hélary).

A distributed algorithm for mutual exclusion in an arbitrary network.
The Computer Journal, 31(4): 289-295,1988.
(With J.M. Hélary, and Plouzeau N.).

Calcul distribué d'un extremum et du routage associé dans un réseau quelconque.
Rairo Inf. Théorique et Applications, 21(3):1-22, 1987.
(With J.M. Hélary and Maddi A.).

Producteur-consommateur : quelques solutions réparties.
TSI, 6(3):231-241, 1987.
(with Plouzeau N. and Verjus J.P.).

Parcours et apprentissage dans un réseau de processus communicants.
TSI, 6(2):127-140, 1987.
(With J.M. Hélary, Maddi A. and Plouzeau N.).

A distributed algorithm to prevent mutual drift between n logical clocks.
Information Processing Letters, 24:199-202, 1987.

Un algorithme d'exclusion mutuelle pour une structure logique en anneau.
TSI, 4(5):471-474, 1985.

Structured specification of communicating systems.
IEEE Transactions on Computers, C32(2):120-133, 1983.
(With G. von Bochmann).

Une analyse de la spécification de la coopération entre processus par variables partagées.
TSI, 1(3):201-210, 1982.

Types in a mixed language system.
BIT, 23(3):246-256, 1981.
(With Darondeau Ph. and le Guernic P.).

An experience in implementing abstract data types.
Software Practice and Experience, 11:315-320, 1980.
(with Banatre M., Couvert A. and Herman D.).

Une expression de la synchronisation pour les types abstraits.
RAIRO Revue Bleue/Computer Science, 12(4)-307-316, 1978.