Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jean Fanchon is active.

Publication


Featured researches published by Jean Fanchon.


mexican international conference on computer science | 2004

Abstract channels as connectors for software components in group communication services

Jean Fanchon; Khalil Drira; Saul E. Pomares Hernandez

Building new services by assembling software components, when adopted at the communication level, would allow developers to build powerful group communication services by assembling proven and efficient algorithms for ordered group communication. The integration of communication protocols with different delivery policies has not been addressed in past research on group communication. This integration cannot be considered as concatenation of protocols and needs delivery policies to be redefined in the context of multi-channel communication. Our paper deals with this issue. We define communication channels as software connectors of the communication level for coordinated group communication. We cover the three standard delivery policies (FIFO order, causal order, and total order).


international conference on concurrency theory | 2002

Regular Sets of Pomsets with Autoconcurrency

Jean Fanchon; Rémi Morin

Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of different kinds. We establish some interesting closure properties that allow us to relate this approach to SP-recognizability in the particular case of series-parallel pomsets. Finally we introduce the framework of compatible languages which generalizes several classical formalisms (including message sequence charts and firing pomsets of Petri nets). In this way, we identify regular sets of pomsets as recognizable subsets in the monoid of multiset sequences.


systems, man and cybernetics | 2002

An efficient multi-channel distributed coordination protocol for collaborative engineering activities

Saul E. Pomares Hernandez; Khalil Drira; Jean Fanchon; Michel Diaz

The advances in several computing fields, such as: networking (topology, bandwidth, etc), powerful data processing, and storage, have enabled in the last years, a great progress in collaborative technology. This collaborative technology is used as a support for advanced collaborative applications [1] such as distributed engineering. The distributed engineering applications consider activities that involve geographically distributed working groups, which interact into work sessions according to a preset or improvised planning. Such activities have been analyzed during the European Distributed System Engineering (DSE) project [2] where we made use of collaboration scenarios, which involved participants distributed in three sites, at Turin, Munich and Paris. During these sessions, participants needed to review design issues in collaboration with remote partners. One of the main problems that we found is to synchronously use, in a consistent manner, distributed engineering components and Conferencing GroupWare, such as the collaborative scenario depicted in Fig. 1a. This figure shows a scenario involving four participants using an Engineering CAD tool to share design data, a Conferencing GroupWare to discuss and comment design diagrams, and a Collaborative authoring tool to produce and review design documents. In this scenario, the participants that interact through the Conferencing Groupware component and Engineering CAD tool must have the same consistent view with respect to the shared design data in order to have a coherent discussion with the ensemble of participants. Otherwise, the comments about the design data would not make sense. This is a simple example of inter-component dependencies that must be satisfied in a consistent manner (Fig. 1b). In this paper we propose a new fully distributed coordination protocol that avoids erroneous collaboration scenarios in distributed engineering components and applications. To achieve global coherence, our approach maintains two consistency levels: at a channel level and at an interchannel level. In this way, we guarantee consistency for monolithic applications or components that use a unique communication channel, and consistency between components and applications that use multichannel communication. This approach has been adopted as a result of the experience of the DSE project.


applications and theory of petri nets | 1999

Trace Channel Nets

Jean Fanchon

We present a new class of nets which includes and extends both Coloured Nets and Fifo Nets by defining weights on edges and markings of places as traces on a concurrent (trace) alphabet. Considering different independence relations on the alphabet, from the maximal one to the empty one (yielding words), Trace Channel Nets open a hierarchy of semantics on a single net structure. Furthermore a field of investigation results from the relationship between the independence on the alphabet and the behaviours of the net. In particular we show that the boundedness of a TCNet is related to particular independence relations, maximal w.r.t. boundedness, that TCNets can be applied to the study of Communicating Finite State Machines (using communication through a trace channel), and that they define a hierarchy of partial order semantics for Nets.


computer and information technology | 2010

Discrete-Time Simulator for Wireless Mobile Agents

Damien Martin-Guillerez; Jean Fanchon

Simulations are widely used to evaluate outcomes of mobile wireless systems. They enable repeatable experiments and permit to evaluate large-scale scenarios without limitations. In this paper, we present a discrete-time simulator for multiple wireless networked agents. This simulator implements a simple opportunistic network layer and a simple physical layer. An extended human interface enables fast and easy creation of new simulations. This simulator is used to validate a new algorithm for a system of agents which communicate locally and self-organize to move boxes from a point of a scene to another.


Lecture Notes in Computer Science | 2004

The Internal-Local-Remote Dependency Model for Generic Coordination in Distributed Collaboration Sessions

José Martín Molina Espinosa; Jean Fanchon; Khalil Drira

This paper considers Distributed Collaboration Sessions (DCS) where distributed users interact through multi-component communicating applications. The paper develops a formal framework that identifies the dependency relationships and the associated coordination rules that should be considered in controlling and managing the interactions between the actors of DCS including software components and human users. Components of the same application are associated with the same category. The users constitute a unique category of actors. We identify three classes of dependency relationships: (1) internal dependency relationship dealing with constraints related to the intra-actor level. (2) local dependency relationship dealing with constrains related to the intra-site level. (3) remote dependency relationship dealing with constraints related to the intra-category level. These three relationship classes are then applied to define dependency management laws for session management including controlling state change, communication scope, role distribution and group membership. Building the multi-actors interdependencies management rules is achieved by composing elementary dependencies relationships that we express as first order logic formula.


Archive | 2003

The Immediate Dependency Relation: An Optimal Way to Ensure Causal Group Communication

Saul E. Pomares Hernandez; Jean Fanchon; Khalil Drira


parallel and distributed computing systems (isca) | 2005

A Fault-Tolerant Causal Broadcast Algorithm to be Applied to Unreliable Networks.

Eduardo Domínguez; Jorge Estudillo Ramirez; Jean Fanchon; Saul E. Pomares Hernandez


international conference on principles of distributed systems | 2001

Causal Broadcast Protocol for Very Large Group Communication Systems

Saúl E. Pomares Hernández; Jean Fanchon; Khalil Drira; Michel Diaz


Physica A-statistical Mechanics and Its Applications | 2015

Crystallization and tile separation in the multi-agent systems

Jacques Henri Collet; Jean Fanchon

Collaboration


Dive into the Jean Fanchon's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Saul E. Pomares Hernandez

National Institute of Astrophysics

View shared research outputs
Top Co-Authors

Avatar

Michel Diaz

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

Cezar Plesca

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

Damien Martin-Guillerez

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

Gerard Padiou

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

Jacques Henri Collet

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

Philippe Queinnec

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

Romulus Grigoras

Centre national de la recherche scientifique

View shared research outputs
Top Co-Authors

Avatar

G. Rodriguez Gomez

National Institute of Astrophysics

View shared research outputs
Researchain Logo
Decentralizing Knowledge