3 research outputs found
Composition de composants dynamiques basée sur des descriptions de leur comportement
Abstract: This thesis proposes solutions to four new problems stemming from a general framework of horizontal behavior composition, in which transition systems are used to model behaviors. The framework allows the realization of a new behavior from a set of available behaviors, through the synthesis of a controller, which delegates each action of the new behavior to an available behavior for execution. In this thesis, the behaviors are associated with software componentsâsuch as web servicesâ, hardware componentsâsuch as connected objectsâ, or even agents. Besides, a composition consists of a controller and the behaviors interacting with the controller for realizing a target behavior, for example the one of a new agent. The ïŹrst problem considers that the behaviors are subject to real-time constraints. The controller synthesis is done using the same algorithms as those of the general framework. Two additional steps are, however, required: one for modeling the interactions between the controller and behaviors in a closed-loop control system and another one for checking whether the closed-loop control system is deadlock free in all of its execution according to the set of real-time constraints. The second problem concerns the assembly of compositions. In contrast to the general framework that uses transition systems as modeling formalism in a purely monolithic control context, the proposed approach, on one hand, uses a process calculus as a formalism to represent all the elements of the closed-loop control system, and, on the other hand, performs a modular control to combine controllers using process calculus operators in order to obtain a global control. The third problem is an extension of the controller synthesis problem when the operations of the behaviors have qualitative or quantitative attributes and the operations of the target behavior are expressed in the form of preferences. The horizontal preference-based behavior composition makes it possible to realize a new behavior that could not be realized without considering preferences. Finally, the last problem is the formation of a most robust team of agents at a lower cost. It is formulated as a multi-objective linear integer programming problem. First, it focuses on ïŹnding a set of compositions such that each of them carries out the same target behavior while satisfying its preferences at best. Second, all the agents involved in the compositions form a team that remains eïŹective even if one or more agents fail. This thesis provides an original solution for each of these problems while illustrating it with some examples. The use of SMV/TLV, Uppaal and PuLP tools makes it possible to check, synthesize or calculate the elements of the proposed examples.RĂ©sumĂ© : Cette thĂšse propose des solutions Ă quatre nouveaux problĂšmes issus dâun cadre gĂ©nĂ©ral de composition horizontale de comportements modĂ©lisĂ©s Ă lâaide de systĂšmes Ă transition. Ce dernier permet la rĂ©alisation dâun nouveau comportement Ă partir dâun ensemble de comportements prĂ©dĂ©finis, Ă travers la synthĂšse dâun contrĂŽleur qui dĂ©lĂšgue chacune de ses actions Ă un comportement prĂ©dĂ©fini pour son exĂ©cution. Dans cette thĂšse, les comportements sont associĂ©s Ă des composants logiciels, comme des services Web, Ă des composants matĂ©riels, comme des objets connectĂ©s, ou Ă des agents. De plus, une composition est constituĂ©e dâun contrĂŽleur et des comportements avec lesquels il interagit pour rĂ©aliser un comportement dĂ©sirĂ©, par exemple celui dâun nouvel agent. Le premier problĂšme considĂšre que les comportements sont soumis Ă des contraintes temps rĂ©el. La synthĂšse de contrĂŽleur sâeffectue en utilisant les mĂȘmes algorithmes que ceux du cadre gĂ©nĂ©ral. Toutefois, deux Ă©tapes additionnelles sont nĂ©cessaires : lâune pour modĂ©liser les interactions entre les comportements et le contrĂŽleur dans une boucle de rĂ©troaction ; lâautre pour vĂ©rifier si la boucle de rĂ©troaction est sans interblocage dans toutes ses exĂ©cutions considĂ©rant lâensemble des contraintes temps rĂ©el. Le deuxiĂšme problĂšme concerne lâassemblage de compositions. Contrairement au cadre gĂ©nĂ©ral qui utilise des systĂšmes Ă transition comme formalisme de modĂ©lisation dans un contexte de contrĂŽle purement monolithique, lâapproche retenue suggĂšre, dâune part, dâutiliser un calcul de processus comme formalisme pour reprĂ©senter tous les Ă©lĂ©ments de la boucle de rĂ©troaction et, dâautre part, dâeffectuer un contrĂŽle modulaire câest-Ă -dire de combiner des contrĂŽleurs Ă lâaide dâopĂ©rateurs du calcul de processus pour obtenir un contrĂŽle global. Le troisiĂšme problĂšme est une extension du problĂšme de la synthĂšse de contrĂŽleur lorsque les actions des comportements possĂšdent des attributs qualitatifs ou quantitatifs et que les actions du comportement dĂ©sirĂ© sont exprimĂ©es sous la forme de prĂ©fĂ©rences. La composition horizontale de comportements basĂ©e sur des prĂ©fĂ©rences permet de rĂ©aliser un nouveau comportement qui ne pourrait lâĂȘtre autrement. Enfin, le dernier problĂšme est celui de la formation dâune Ă©quipe dâagents la plus robuste possible et Ă moindre coĂ»t. Il est formulĂ© comme une problĂšme de programmation linĂ©aire multi-objective en nombre entier. PremiĂšrement, il sâagit de trouver un ensemble de compositions, chacune rĂ©alisant le mĂȘme comportement dĂ©sirĂ© tout en satisfaisant au mieux ses prĂ©fĂ©rences. DeuxiĂšmement, lâensemble des agents impliquĂ©s dans les compositions forment une Ă©quipe qui survit aux pannes dâun ou plusieurs agents. Cette thĂšse apporte une solution originale Ă chacun de ces problĂšmes tout en lâillustrant Ă lâaide dâexemples. Lâutilisation des outils SMV/TLV, Uppaal et PuLP permet de vĂ©rifier, de synthĂ©tiser ou de calculer des Ă©lĂ©ments des exemples proposĂ©s
Team formation through preference-based behavior composition
A team formation problem consists in finding an effective group of experts in a social network to accomplish a job with a minimum expenditure of energy and time. This problem has been transposed into the domain of multiagent systems to form a team of autonomous agents whose mission is to achieve a given goal. There is a wide range of such problems. This paper generalizes one of them by assigning explicit behaviors to agents whose tasks are equipped with multiple attributes. Their values are compared with preferences attached to the desired tasks of the goal. A synthesized controller realizes the goal by invoking tasks of a subset of the available agents, called a composition in this paper. Furthermore, utility values are assigned to compositions and robustness is considered to be an important property of a team to prevent its deterioration when one or more of its agents fail. Finding a robust team that satisfies the goalâs preferences with better utility values for compositions constitutes a difficult optimization problem. The proposed method to solve this problem consists in three phases: controller synthesis with filtering on tasks with respect to some qualitative preferences, composition ranking based on their fitness, and multiobjective mathematical optimization