Time-varying graphs and dynamic networks

A Casteigts, P Flocchini, W Quattrociocchi… - International Journal of …, 2012 - Taylor & Francis
The past few years have seen intensive research efforts carried out in some apparently
unrelated areas of dynamic systems–delay-tolerant networks, opportunistic-mobility …

Grgen. net: The expressive, convenient and fast graph rewrite system

E Jakumeit, S Buchwald, M Kroll - International Journal on Software Tools …, 2010 - Springer
GrGen. NET is a generative programming system for graph rewriting, transforming intuitive
and expressive rewrite rule specifications into highly efficient. NET code. The user is …

Certified impossibility results for byzantine-tolerant mobile robots

C Auger, Z Bouzid, P Courtieu, S Tixeuil… - Stabilization, Safety, and …, 2013 - Springer
We propose a framework to build formal developments for robot networks using the Coq
proof assistant, to state and prove formally various properties. We focus in this paper on …

Characterizing topological assumptions of distributed algorithms in dynamic networks

A Casteigts, S Chaumette, A Ferreira - … 2009, Piran, Slovenia, May 25-27 …, 2010 - Springer
Besides the complexity in time or in number of messages, a common approach for analyzing
distributed algorithms is to look at their assumptions on the underlying network. This paper …

Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth

A Krebs, O Verbitsky - 2015 30th annual ACM/IEEE symposium …, 2015 - ieeexplore.ieee.org
Given a connected graph G and its vertex x, let U (G, x) denote the universal cover of G
obtained by unfolding G into a tree starting from x. Let T= T (n) be the minimum number such …

[PDF][PDF] Обзор подходов к верификации распределенных систем

ИБ Бурдонов, АС Косачев, ВН Пономаренко… - ИСП РАН …, 2003 - ispras.ru
Распределенными системами называются программно-аппаратные системы, в
которых исполнение операций (действий, вычислений), необходимых для обеспечения …

A journey through dynamic networks (with excursions)

A Casteigts - 2018 - hal.science
Résumé The journey recounted in this document spanned a period of about 10 years, from
the end of the PhD (2007) to current (early 2018). The rst ve years correspond to two …

Finding structure in dynamic networks

A Casteigts - ar** of distributed algorithms in dynamic networks
A Casteigts, R Laplace - ar**, running, and visualizing
distributed algorithms in dynamic networks. With JBotSim, one can implement an idea in …