Le séminaire en bref

Le séminaire 68NQRT est un séminaire commun de l'IRISA et d'Inria Rennes. Il a lieu le Jeudi à 14 heures 30 par défaut dans la salle « Turing ». Les thèmes du séminaire recouvrent des thèmes étudiés dans les départements « réseaux, télécommunication et services » et « langage et génie logiciel » de l'IRISA, ou des thèmes « Algorithmique, programmation, logiciels et architectures » et  « Réseaux, systèmes et services, calcul distribué » d'Inria. On y trouve des exposés introductifs, avancés ou prospectifs dans les thèmes du génie logiciel, de l'informatique théorique, des mathématiques discrètes et de l'intelligence artificielle.

Prochain Exposé

24 mai en salle Turing

Exposé de Alban Grastien

Diagnosis of Discrete-Event Systems as an Exploration Problem

We define the diagnosis of discrete-event systems (DES) as the problem of finding all minimal solutions in a ``hypothesis space''. This formulation allows us to provide a new approach to diagnosis of DES. While the traditional approach first computes all traces on the system model consistent with the observation and then extracts the diagnosis information, we propose a consistency-based approach where the intersection between the certain sets of hypotheses and the diagnosis is tested. In this talk, we discuss 1) how the sets of hypotheses should be defined to infer the minimal diagnosis and 2) how the test operation can be implemented practically.

Alban Grastien did his PhD under the direction of Marie-Odile Cordier and the co-supervision of Christine Largouët at Irisa on the topic of diagnosis of large, reconfigurable DES. Since 2006, he works at the Canberra Research Laboratory of NICTA (Australia), where he also holds an adjunct position at the Austalian National University.

Exposés des prochaines semaines

31 mai en salle Turing

Séminaire commun avec le département "Réseaux, télécommunication et services"

theorie des jeux en telecoms

Séminaire commun avec le département Réseaux, télécommunication et services de l'IRISA. Plus d'information bientôt sur cette page.

7 juin

Exposé de Hristo Djidjev (Los Alamos National Laboratory)

Graph partitioning methods for computing the community structure of a network

A promising approach to analyzing the structure of a network is to subdivide the set of its vertices into subsets (clusters, also called communities) so that the in-cluster edges are much denser than the between-cluster ones. One of the most useful measures of cluster quality is the modularity of the partition, which measures the difference between the fraction of the edges joining vertices from the same cluster and the expected fraction of such edges in a random graph. In this talk we show that the problem of finding a partition maximizing the modularity of a given graph G can be reduced to a minimum weighted cut problem on a complete graph with the same vertices as G. We then show that the resulting minimum cut problem can be efficiently solved by adapting existing graph partitioning techniques. Our algorithm finds clustering of a comparable quality and is much faster than the existing clustering algorithms.

14 juin

Exposé de Guillaume Aucher

Title to be anounced

Abstract to be anounced

21 juin

Exposé de Burkhart Wolf

Title to be anounced

Abstract to be anounced

28 juin

Exposé de Loïg Jézéquel

Title to be anounced

Abstract to be anounced

Mercredi 3 juillet

Exposé de Laurie Ricker (Univ. Mount Allison/Vertecs)

Robustness of Synchronous Communication Protocols with Bounded Delay for Decentralized Discrete-Event Control

Recent work on modeling communication delay between communicating decentralized discrete-event controllers only considers the case when all observations are communicated. When this condition is relaxed, it may yet be possible to formulate communicating decentralized controllers that can solve the control problem. Instead of synthesizing reduced communication protocols under bounded delay, synchronous communication protocols (where not all observations are communicated) are examined for their robustness under conditions when only the upper bound for the delay is known. This is joint work with Waselul Sadid and Shahin Hashtrudi-Zad