[1] A. Dawar and D. Janin. On the bisimulation invariant fragment of monadic Σ1 in the finite. Information Processing Letter, 103(3):94-101, 2007. [ bib ]
[2] Shehla Abbas, Mohamed Mosbah, and Akka Zemmari. A generic distributed algorithm for computing by random mobile agents, 2007. To appear. [ bib | http ]
[3] Jérémie Chalopin and Yves Métivier. An efficient message passing election algorithm based on mazurkiewicz's algorithm. Fundam. Inform., 80(1-3):221-246, 2007. [ bib ]
[4] Brahim Hamid, Mohamed Mosbah, and Akka Zemmari. A self-stabilizing distributed algorithm for resolving conflicts, 2007. http://www.springerlink.com/content/b0363n8x317r2186/. [ bib ]
[5] Projet RODIN. Rodin platform. http://rodin-b-sharp.sourceforge.net/, 2007. [ bib ]
[6] Nazim Benaissa. Modelling attacker's knowledge for cascade cryptographic protocols. In ABZ2008. Springer, 2008. [ bib ]
[7] Joris Rehm. Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method. Technical report, LORIA, 2008. Submited to STTT-Special Event ISOLA 2007. [ bib ]
[8] Joris Rehm. From absolute-timer to relative-countdown: Patterns for model-checking. Technical report, LORIA, 2008. Submited to RTSS 2008. [ bib ]
[9] J. Bernet and D. Janin. From asynchronous to synchronous specification for distributed program synthesis. In Internationnal Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 08), volume 4910 of Lectures Notes in Computer Science, pages 161-173. Springer, 2008. [ bib ]
[10] Jérémie Chalopin, Anton Mazurkiewicz, and Yves Métivier. Labelled (hyper)graphs, negotiations and the naming problem. In ICGT, Lecture Notes in Computer Science, 2008. [ bib ]
[11] Bilel Derbel, Mohamed Mosbah, and Stefan Gruner. Mobile agents for implementing local computations in graphs. In ICGT, Lecture Notes in Computer Science, 2008. [ bib ]
[12] M.A. Haddar, A. Hadj Kacem, Y. Metivier, M. Mosbah, and M. Jmaiel. Electing a leader in the local computation model using mobile agents. Computer Systems and Applications, 2008. AICCSA 2008. IEEE/ACS International Conference on, pages 473-480, 31 2008-April 4 2008. [ bib ]
[13] M. A. Haddar, Ahmed Hadj Kacem, Yves Métivier, Mohamed Mosbah, and Mohamed Jmaiel. Proving distributed algorithms for mobile agents: Examples of spanning tree computation in anonymous networks. In ICDCN, pages 286-291, 2008. [ bib ]
[14] J. Chalopin, E. Godard, and Y. Métivier. Local terminations and distributed computability in anonymous networks. In DISC (22nd International Symposium on DistributedComputing), 2008. [ bib ]
[15] J. Chalopin, A. Mazurkiewicz, and Y. Métivier. Labelled (hyper)graphs, negotiations and the naming problem. In CGT (4th International Conference on Graph Transformation), number 5214 in lncs, pages 54-68. Springer, 2008. [ bib ]
[16] Jérémie Chalopin and Daniel Paulsuma. Graph labelling derived from models in distributed computing: a complete complexity classification. Technical report, LABRI, 2008. [ bib ]
[17] Laboratoire LABRI. Visidia. http://www.labri.fr/projet/visidia/, 2008. [ bib ]
[18] Projet ANR-RIMEL. Développement d'algorithmes répartis. Livrable rimel, LORIA, Janvier/Février 2008. [ bib ]
[19] Dominique Cansell. Développement incrémental et preuve de l'algorithme d'énumération de mazurkiewicz. Rimel, LORIA, January 2008. [ bib ]
[20] Dominique Cansell. Développement incrémental et preuve de l'algorithme d'élection du leader dans un 2-arbre. Rimel, LORIA, January 2008. [ bib ]
[21] Dominique Cansell. Développement incrémental et preuve de l'algorithme de Szymanski, Shi et Prywes. Rimel, LORIA, January 2008. [ bib ]
[22] Nazim Benaïssa and Dominique Méry. Développement incrémental prouvé de systèmes répartis : le cas mondex. Rimel, LORIA, January 2008. [ bib ]
[23] Dominique Méry. Teaching programming methodology using event b. In H. Habrias, editor, The B Method: from Research to Teaching, June 2008. [ bib ]
[24] Projet ANR-RIMEL. Proof-based design patterns. Livrable rimel, LORIA, Juillet 2008. [ bib ]
[25] Projet ANR-RIMEL. Intégration de contraintes temps-réel au sein d'un processus de développement incrémental basé sur la preuve. Livrable rimel, LORIA, Juillet 2008. [ bib ]

This file has been generated by bibtex2html 1.87.