Model driven capabilities of the DA-GRS model

2006 International Conference on Autonomic and Autonomous Systems, ICAS'06

Volumn , Issue , 2006, Pages 24-

  Casteigts, Arnaud ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER NETWORKS; GRAPH THEORY; MATHEMATICAL MODELS;

DYNAMIC NETWORKS; GRAPH ALGORITHMS; SPANNING FOREST ALGORITHM;

AUTONOMOUS AGENTS;

EID: 36448936763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAS.2006.35     Document Type: Conference Paper

References (9)

1. M. Bauderon, Y. Metivier, M. Mosbah, and A. Sellami. From local computations to asynchronous message passing systems, 2002.
2. A. Casteigts. SimuDAGRS, a Dynamic Network simulator for algorithms modeled by DA-GRS. available at http://www.labri.fr/perso/casteigt/simulator. html.
3. A. Casteigts and S. Chaumette. Dynamicity Aware Graph Relabeling Systems - a model to describe MANet algorithms. In Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems, 2005.
4. A. Casteigts and S. Chaumette. DA-GRS and the constraint based synchronization: a unifying approach to deal with dynamic networks, submitted to WASA'06.
5. J. Chalopin and Y. Métivier. A bridge between the asynchronous message passing model and local computations in graphs. In Mathematical Foundations of Computer Science (MFCS 2005), volume 3618 of Lecture Notes in Computer Science, pages 212-223. Springer-Verlag, aug 2005.
6. D. Delcampo. Validation du modele DA-GRS sur la plateforme GRID5000, et sur terminaux mobiles communiquants. http://www.labri.fr/perso/casteigt/docs/ dagrs-grid5000.ps.
7. I. Litovsky, Y. Metivier, and E. Sopena. Graph relabelling systems and distributed algorithms. In W. S. Publishing, editor, Handbook of graph grammars and computing by graph transformation, volume III, Eds. H. Ehrig, H.J. Kreowski, U. Montanari and G. Rozenberg, pages 1-56, 1999.
8. Y. Metivier, N. Saheb, and A. Zemmari. Analysis of a randomized rendezvous algorithm. Inf. Comput., 184(1):109-128, 2003.
9. Y. Métivier, N. Saheb-Djahromi, and. A. Zemmari. Randomized rendezvous. In Colloquium on mathematics and computer science: algorithms, trees, combinatorics and probabilities, Trends in mathematics, pages 183-194. Birkhäuser, 2000.