Dissertationen zum Thema „Ordonnancement coopératif“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-29 Dissertationen für die Forschung zum Thema "Ordonnancement coopératif" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
Gargouri, Emna. „Ordonnancement coopératif en industrie agroalimentaire“. Lille 1, 2003. https://pepite-depot.univ-lille.fr/RESTREINT/Th_Num/2003/50376-2003-325.pdf.
Der volle Inhalt der QuelleDavid, Michaël. „Définition d'un cadre pour l'organisation et l'évaluation des activités du travail coopératif“. Nancy 1, 2004. http://docnum.univ-lorraine.fr/public/SCD_T_2004_0202_DAVID.pdf.
Der volle Inhalt der QuelleThe object of this study is the definition of a framework which assists cooperative work. The approach is composed by 4 axes which enable to define an adequate organization of the co-operative activities. Axis 1 relates to the structuring of the activities: analysis of dependences, gathering and/or decomposition in tasks, workgroups scheduling. Axis 2 relates to the characterization of the activities: definition of the roles and management of the interfaces. Axis 3 relates to the work organization evaluation: estimate of the lead times, loads and costs. Axis 4 relates to the work organization optimization: implementation of various solutions for activities organization and execution. Methods resulting from the graph theory, partitioning techniques and performance evaluation are proposed to support each axis. A software tool was developed to implement these proposals. It gives a support for the decision-making in management, the dynamic control of the cooperative processes. .
Nguyen, Hai Dang. „Déploiement et ordonnancement dans Wimax avec relais : IEEE802.16j“. Phd thesis, Université d'Evry-Val d'Essonne, 2011. http://tel.archives-ouvertes.fr/tel-00878774.
Der volle Inhalt der QuelleMouloua, Zerouk. „Ordonnancements coopératifs pour les chaînes logistiques“. Phd thesis, Institut National Polytechnique de Lorraine - INPL, 2007. http://tel.archives-ouvertes.fr/tel-00606329.
Der volle Inhalt der QuelleMouloua, Zerouk. „Ordonnancements coopératifs pour les chaînes logistiques“. Electronic Thesis or Diss., Vandoeuvre-les-Nancy, INPL, 2007. http://www.theses.fr/2007INPL090N.
Der volle Inhalt der QuelleWe propose new decision methods for coordinating supply chain scheduling. We focus on the cooperation between supply chain partners by means of negotiations about suppliers’ raw materials arrival dates, and customers’ delivery dates of finished. We consider a supply chain, which consists in a network of independant enterprises. The finished products (or sub products) of the assembly enterprise are produced using components and/or sub products supplied by other enterprises or by external suppliers. We are at the scheduling level and each enterprise builds its own schedules associated with its production centers. As an operation can be performed only when the production center has received the necessary components, the schedules are dependent. This induces negotiations between decision centers which is expressed by penalty functions associated with soft and hard release dates and due dates. A global solution is searched by an iterative decomposition approach including alternatively bilateral negotiations between the production decision centers and just in time scheduling, minimizing the local total sum of penalties. To solve each local just-in-time scheduling problem, we propose an approximation approach based on meta-heuristics, which explores the set of solutions, in which a solution is described by the job order on each machine and is evaluated using a “pert cost” algorithm.. A semi-decentralized control is suggested to assume the negotiation convergence. Furthermore, we study some transportation optimization problems in supply chains
Rammal, Darine. „Memory safety for synchronous reactive programming“. Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1002.
Der volle Inhalt der QuelleSynchronous Reactive Languages are an excellent choice for IoT programming due to their clear system-environment interaction semantics. However, when it comes to safety- critial or resource-constrained systems, recent proposals like Fairthreads or ReactiveML face a well-known issue. Fairthreads' manual memory management can lead to errors, while ReactiveML's garbage collection ensures memory safety but introduces execution overhead. This thesis aims to address the memory safety issue by developing a reactive programming language specifically designed for real-time systems, incorporating cooperative threads and synchronous execution. Drawing from the robust type system of the Rust programming language, we propose a Rust-like type system for a kernel reactive programming language named MSSL. MSSL features a cooperative threading model and facilitates mutable data sharing between threads while preserving type and borrowing safety. To achieve this, we introduce a novel abstraction called Trc (Thread Reference Counting), which combines the ownership safety of Rust references with the reference counting mechanism of Rust smart pointers. Then, we present the semantics and type system of MSSL to demonstrate its capabilities in maintaining type safety, borrowing safety, and concurrency safety. Furthermore, we extend MSSL by introducing reactive extensions, incorporating the concept of signals that offer powerful, flexible, and reliable means of communication. Finally, we provide a Java implementation of the complete MSSL set, based on the semantic and typing rules of its type system
Tranvouez, Erwan. „IAD et ordonnancement, une approche coopérative du réordonnancement par systèmes multi-agents“. Aix-Marseille 3, 2001. http://www.theses.fr/2001AIX30023.
Der volle Inhalt der QuelleDistributed Artificial Intelligence (DAI) and more particularly MultiAgent Systems (MAS) propose nowadays solutions to many industrial problems. Our research focuses more precisely on workshop scheduling facing dirupting events. We address this issue by proposing a co-operative workshop rescheduling method with a Cooperative Distributed Problem Solving (CDPS) approach. This method is based on an organisationnal modelling of a workshop granting autonomy to the workshop machines, enabling them to engage cooperation to manage a disruption the earliest as possible. To achieve this, we have elaborated a set of repair scheduling strategies and operations consisting in local and limited modification of a disruptive scheduling. To define the cooperative processes involved in the cooperative rescheduling method, we propose a workshop multiagent modelling composed of two categories of agents (scheduler and service agents). .
Haudot, Luc. „Une approche orientée utilisateur pour la conception de systèmes coopératifs en ordonnancement de production“. Toulouse, INSA, 1996. http://www.theses.fr/1996ISAT0015.
Der volle Inhalt der QuelleKacem, Imed. „Ordonnancement multicritère des job-shops flexibles : formulation, bornes inférieures et approche évolutionniste coopérative“. Lille 1, 2003. https://pepite-depot.univ-lille.fr/RESTREINT/Th_Num/2003/50376-2003-3.pdf.
Der volle Inhalt der QuelleDeux approches ont été développées dans ce modèle. La première est l'Approche par Localisation (AL). Elle permet de construire un ensemble de solutions en minimisant les critères liés à la répartition des ressources dans le cas des job-shops flexibles. La deuxième est une approche basée sur des techniques à stratégie d'évolution contrôlées pour améliorer la qualité des solutions données par l'AL. Dans ce cadre, trois nouveaux codages ont été mis en œuvre tout en développant les opérateurs génétiques associés. En outre, quelques aspects modulaires de cette méthode sont également présentés dans le troisième chapitre. Dans le cinquième chapitre, nous illustrons la mise en oeuvre des différentes approches proposées sur un jeu de données afin d'évaluer leurs performances. Nous présentons également quelques comparaisons à d'autres méthodes. De plus, nous validons la méthode proposée sur une grande série d'exemples pratiques. Enfin, nous concluons ce mémoire en rappelant les grandes lignes des travaux menés et en présentant quelques perspectives de recherche futures concernant les possibles applications réelles de l'approche développée
Autuori, Julien. „Energie, coopération méta-heuristiques et logique floue pour l'optimisation difficile“. Thesis, Troyes, 2014. http://www.theses.fr/2014TROY0036/document.
Der volle Inhalt der QuelleIn this thesis, the solution space exploration by the metaheuristic is developed. The metaheuristics optimization methods are used to solve NP-hard problems. They explore randomly the search space to look for the best solutions. In a first step, the solution set is modeled by a one-dimensional space by a Mapping Method (MaM). Metrics are proposed to evaluate the search space exploration by a metaheuristic, identifying the explored and unexplored zones. These metrics are used to guide the search space exploration of an optimization method. The convergence is improved by emphasizing the research in the zones explored. To get out local minima, the exploration is diversified by pointing it towards the unexplored zones. Combining the neighbour discovery of the solutions and these mapping metrics, it is possible to improve the performance of metaheuristics. Several single-objective and multi-objective algorithms are implemented in the classic version, hybridized with local search and MaM. The Flexible Job Shop Problem (FJSP) is used as a reference problem. The experimentations with hybridized algorithms show performance improved
Gzara, Mariem. „Méthode coopérative d'aide multicritère à l'ordonnancement flou“. Lille 1, 2001. http://www.theses.fr/2001LIL10117.
Der volle Inhalt der QuelleGuillaume, Pinot. „Coopération homme-machine pour l'ordonnancement sous incertitudes“. Phd thesis, Université de Nantes, 2008. http://tel.archives-ouvertes.fr/tel-00409897.
Der volle Inhalt der QuelleD'autre part, l'humain n'est généralement pas pris en compte dans l'élaboration de la méthode d'ordonnancement. Pourtant, l'humain joue un rôle central dans le processus d'ordonnancement, et ses connaissances du terrain sont précieuses. C'est pourquoi nous pensons que des systèmes homme-machine efficaces sont nécessaires au bon fonctionnement des méthodes d'ordonnancement d'atelier.
Pour cela, nous nous reposons sur l'ordonnancement de groupes. Cette méthode d'ordonnancement d'atelier comporte différents avantages pour notre recherche : c'est une méthode d'ordonnancement sous incertitudes et sa structure est facilement manipulable par l'humain. Nous étudions les systèmes homme-machine existant pour cette méthode d'ordonnancement. Nous proposons ensuite un nouveau système homme-machine, afin d'améliorer la coopération. Dans ce système, nous utilisons la qualité dans le meilleur des cas dans un ordonnancement de groupes. Comme ce thème n'est pas encore abordé dans la littérature, nous proposons des bornes inférieures, des heuristiques et une méthode exacte pour résoudre ce problème.
Bastide, Rémi. „Objets coopératifs : un formalisme pour la modélisation des systèmes concurrents“. Toulouse 3, 1992. http://www.theses.fr/1992TOU30247.
Der volle Inhalt der QuelleBasseur, Matthieu. „Conception d'algorithmes coopératifs pour l'optimisation multi-objectif : application aux problèmes d'ordonnancement de type flow-shop“. Lille 1, 2005. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/2005/50376-2005-Basseur.pdf.
Der volle Inhalt der QuelleEnsuite, nous proposons de faire coopérer AGA avec des méthodes dédiées à l'intensification de la recherche. Nous proposons un premier type de coopération avec PLS (Recherche Locale Pareto) en proposant différents algorithmes de type recherche mimétique. Les tests effectués sur les différentes coopérations montrent l'intérêt d'utiliser un algorithme d'exploration (AGA), ainsi que l'efficacité des coopérations adaptives entre différents algorithmes. Puis, nous proposons une coopération originale avec l'algorithme MOPR (Path Relinking Multi-Objectif). Pour cela nous avons défini différents mécanismes pour adapter les algorithmes de path-relinking au cas multi-objectif. Ce type d'approche est très prometteur. Enfin, les approches coopératives avec la méthode exacte bi-objectif TPM (Méthode Deux Phases) ont été envisagées. Trois approches ont été proposées, une exacte et deux heuristique. Les expérimentations ont permis d'améliorer sensiblement les meilleures solutions obtenues. Les différentes approches testées, montrent l'intérêt des mécanismes de transition adaptative entre algorithmes, ainsi l'apport réalisé par l'utilisation de méthodes d'optimisation très différentes, dans le cadre de l'optimisation multi-objectif
Huguet, Marie-José. „Approche par contraintes pour l'aide à la décision et à la coopération en gestion de production“. Toulouse, INSA, 1994. http://www.theses.fr/1994ISAT0047.
Der volle Inhalt der QuelleSteff, Yann. „SMA et gestion coopérative de réseaux et systèmes : un cadre méthodologique pour une macro-organisation autonome“. Toulouse 3, 2002. http://www.theses.fr/2002TOU30043.
Der volle Inhalt der QuelleQuesnel, Flavien. „Vers une gestion coopérative des infrastructures virtualisées à large échelle : le cas de l'ordonnancement“. Phd thesis, Ecole des Mines de Nantes, 2013. http://tel.archives-ouvertes.fr/tel-00821103.
Der volle Inhalt der QuelleFauré, Fabienne. „Gestion de configuration et migration dans les systèmes coopératifs : une architecture répartie orientée services“. Toulouse 3, 1994. http://www.theses.fr/1994TOU30253.
Der volle Inhalt der QuelleDe, angelis cordeiro Daniel. „Impact de la coopération dans les nouvelles plates-formes de calcul à hautes performances“. Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00767078.
Der volle Inhalt der QuelleDespontin-Monsarrat, Emmanuelle. „Aide à la décision pour la coopération inter-entreprises dans le cadre de la production à la commande“. Phd thesis, Université Paul Sabatier - Toulouse III, 2004. http://tel.archives-ouvertes.fr/tel-00008466.
Der volle Inhalt der QuelleAngelis, Cordeiro Daniel de. „Impact de la coopération dans les nouvelles plates-formes de calcul à hautes performances“. Thesis, Grenoble, 2012. http://www.theses.fr/2012GRENM007/document.
Der volle Inhalt der QuelleComputer science is deeply changing methodological aspects of the discovery process in different areas of knowledge. Researchers have at their disposal new capabilities that can create novel research opportunities. Parallel and distributed platforms composed of resources shared between different participants can make these new capabilities accessible to every researcher at every level, delivering computational power that was restricted before to bigger (and wealthy) scientific projects. This work explores four different facets of the rules that govern how organizations engage in collaboration on modern parallel and distributed platforms. Using classical combinatorial tools, multi-objective scheduling and game-theory, we showed how to compute schedules with good trade-offs between the results got by the participants and the global performance of the platform. By ensuring fair results and guaranteeing performance improvements for the participants, we can create an efficient platform where everyone always feels encouraged to collaborate and to share its resources. First, we study the collaboration between selfish organizations. We show how the selfish behavior between the participants imposes a lower bound on the global makespan. We present algorithms that cope with the selfishness of the organizations and that achieve good fairness in practice. The second study is about collaboration between organizations that can tolerate a limited degradation on their performance if this can help ameliorate the global makespan. We improve the existing inapproximation bounds for this problem and present new algorithms whose guarantees are close to the Pareto set. The third form of collaboration studied is between rational participants that can independently choose the best strategy for their jobs. We present a non-cooperative game-theoretic model for the problem and show how coordination mechanisms allow the creation of approximate pure equilibria with bounded price of anarchy. Finally, we study collaboration between users sharing a set of common resources. We present a method that enumerates the frontier of best compromise solutions for the users and selects the solution that brings the best value for the global performance function
Ourari, Samia. „De l'ordonnancement déterministe à l'ordonnancement distribué sous incertitudes“. Phd thesis, Toulouse 3, 2011. http://thesesups.ups-tlse.fr/1267/.
Der volle Inhalt der QuelleThis work presents the study of two scheduling problems. The former concerns the exact and centralised resolution of a single machine problem, and the latter, the distributed and cooperative resolution of a job shop, each machine being viewed as an actor having its own decision autonomy. For both problems, dominance conditions are used, in the first case, in order to reduce the algorithmic complexity for seeking feasible or optimal solutions, and in the second case, to increase the ability of each actor to face uncertainties. In the first part, a theorem, stated in the early eighties, is recalled that allows to characterize a set of dominant solutions, considering a one-machine sequencing problem. On the basis of the theorem, new analytical and numerical dominance conditions are established that allow to tighten the set of dominant sequences. Then original and efficient mathematical formulations, in the form of integer linear programs, are proposed for modelling and solving single machine problems. Two kinds of criterion are considered : the minimization of the maximum lateness and the minimization of the number of tardy jobs. In the second part, the job shop scheduling problem is studied, using a multi-actor framework, assuming that each actor manages one machine. Taking into account the decisional autonomy and the own objectives of each actor, scheduling is seen as a distributed and dynamic function, where the global solution emerges from negotiations among the actors. We assume that each actor builds up its own local organisation in a robust way, having an imprecise and partial knowledge of the other actor's organisation. We particularly show how maintaining on each actor a set of dominant job sequences so that the worst performance can be bounded. Then a new scheduling approach is sketched where actors initiate point-to-point negotiation, in a distributed way, so as to progressively converge toward trade-off decisions that balance local and global objectives
Villemur, Thierry. „Conception de services et de protocoles pour la gestion de groupes coopératifs“. Phd thesis, Université Paul Sabatier - Toulouse III, 1995. http://tel.archives-ouvertes.fr/tel-00146528.
Der volle Inhalt der QuelleJørgensen, Carl-Johan. „Scheduling activities under spatial and temporal constraints to populate virtual urban environments“. Thesis, Rennes 1, 2015. http://www.theses.fr/2015REN1S033/document.
Der volle Inhalt der QuelleCrowd simulation models usually aim at producing visually credible crowds with the intent of giving life to virtual environments. Our work focusses on generating statistically consistent behaviours that can be used to pilot crowd simulation models over long periods of time, up to multiple days. In real crowds, people's behaviours mainly depend on the activities they intend to perform. The way this activity is scheduled rely on the close interaction between the environment, space and time constraints associated with the activity and personal characteristics of individuals. Compared to the state of the art, our model better handle this interaction. Our main contributions lie in the domain of activity scheduling and path planning. First, we propose an individual activity scheduling process and its extension to cooperative activity scheduling. Based on descriptions of the environment, of intended activities and of agents' characteristics, these processes generate a task schedule for each agent. Locations where the tasks should be performed are selected and a relaxed agenda is produced. This task schedule is compatible with spatial and temporal constraints associated with the environment and with the intended activity of the agent and of other cooperating agents. It also takes into account the agents personal characteristics, inducing diversity in produced schedules. We show that our model produces schedules statistically coherent with the ones produced by humans in the same situations. Second, we propose a hierarchical path-planning process. It relies on an automatic environment analysis process that produces a semantically coherent hierarchical representation of virtual cities. The hierarchical nature of this representation is used to model different levels of decision making related to path planning. A coarse path is first computed, then refined during navigation when relevant information is available. It enable the agent to seamlessly adapt its path to unexpected events. The proposed model handles long term rational decisions driving the navigation of agents in virtual cities. It considers the strong relationship between time, space and activity to produce more credible agents' behaviours. It can be used to easily populate virtual cities in which observable crowd phenomena emerge from individual activities
Yahouni, Zakaria. „Le meilleur des cas pour l’ordonnancement de groupes : Un nouvel indicateur proactif-réactif pour l’ordonnancement sous incertitudes“. Thesis, Ecole centrale de Nantes, 2017. http://www.theses.fr/2017ECDN0010/document.
Der volle Inhalt der QuelleThis thesis represents a study of a new decision-aid criterion for manufacturing scheduling under uncertainties. The contributions made in this work relate to the groups of permutable operations context. This approach consists of proposing a flexible scheduling solution characterizing a non-enumerated and finite set of schedules. An operator is then supposed to select the appropriate schedule that best copes with the disturbances occurred on the shop floor. We focus particularly on this selection phase and we emphasize the important of the human for decision making. First, we present the best-case; a decision-aid criterion for computing the best schedule characterized by the groups of permutable operations method. We propose lower bounds for computing the best starting/completion time of operations. These lower bounds are then implemented in a branch and bound procedure in order to compute the best-case. Through to several simulations carried out on literature benchmark instances, we stress the usefulness of such criterion in a decision-aid system. Finally, we propose a Human-Machine-Interface (HMI) adapted to the groups of permutable operations and driven by a multi-criteria decision-aid system. The implementation results of this HMI on a real case study provided some insight about the practice of decision-making and scheduling under uncertainties
Haddadou, Nadia. „Réseaux ad hoc véhiculaires : vers une dissémination de données efficace, coopérative et fiable“. Thesis, Paris Est, 2014. http://www.theses.fr/2014PEST1023/document.
Der volle Inhalt der QuelleVehicular Ad Hoc Networks (VANETs) allow sharing different kinds of data between vehicles in a collaborative way. In this thesis, we are particularly interested in road safety applications, designed for the exchange of information on road traffic and conditions. This kind of applications have strict Quality of Service (QoS) requirements, as data must be routed thoroughly and without any delays so for assuring the timely delivery of useful information to the drivers. In this context, data routing must face several issues raised by the high mobility and dispersion of vehicles, inadequate or completely lacking infrastructure, a variable network density, network saturation due to the large of information to deliver, and the size of the geographical areas to cover. Indeed, the problem of data dissemination in VANETs is non-trivial, and several research challenges must be solved in order to provide an efficient, collaborative, and reliable support for road safety applications. Specifically, we will address the problem of collaborative data dissemination through the following three questions: “How to perform data dissemination?”, “When should we do it?”, and “What must be disseminated?” We have provided answers to these questions through the three contributions of this thesis. Our first contribution is an efficient dissemination strategy, specifically tailored to the importance of the exchanged information as well as its lifespan, which is able to avoid the intensive dissemination process that generates network congestion and data redundancy. We confirm our statements and validate the performance of our solution by modeling it using a discrete-time Markov chain, which demonstrates the number of necessary retransmissions for all concerned vehicles to receive information. Moreover, we performed extensive simulations that show a reduction of up to 90% of redundant messages with respect to message flooding dissemination strategies. Next, in order to further improve the road safety message dissemination process, we propose a communications channel access scheduler, which aims at reducing the number of collisions caused by IEEE 802.11p/1609.4 multi-channel synchronizations, and thus improving the data reception rate. We base our solution on the optimal stopping theory, which chooses the right moment to send information by balancing the channel occupancy rate, the data delivery efficiency, and the maximum deferment delay tolerated by the information. To this end, we formulate the optimal stopping theory through a Markov decision process (MDP). We show through simulation-based evaluations an improvement of the reception rate of up to 25% and a reduction of up to 47% of message losses. Finally, after being interested in the quantitative aspect of network performance, we centered our efforts on improving the reliability of the dissemination process, which is obtained by motivating vehicles to cooperate and evicting malicious vehicles from the process. To this end, we propose a trust model inspired on signaling games, which are a type of dynamic Bayesian games. Through the use of our model, equilibrium is achieved, thus resulting in a fast and low-cost vehicle self-selection process. We define the parameters of our trust model through a discrete-time Markov chain model. To the best of our knowledge, our solution is the only existing solution that tackles the negative effects introduced by the presence of both malicious and selfish vehicles in a VANET. We evaluated the performance of our solution by modeling it using a Markov chain, and a set of simulations. Our results show that up to 100% of malicious vehicles are evicted while keeping a high cooperation rate, thus achieving an improvement of 42% when compared to other similar solutions
Lizarralde, Iban. „Aide au pilotage d'activités d'ingénierie pour le développement distribué d'un système complexe“. Phd thesis, INSA de Toulouse, 2007. http://tel.archives-ouvertes.fr/tel-00163853.
Der volle Inhalt der QuelleZouinkhi, Ahmed. „Contribution à la modélisation de produit actif communicant : spécification et évaluation d'un protocole de communication orienté sécurité des produits“. Thesis, Nancy 1, 2011. http://www.theses.fr/2011NAN10010/document.
Der volle Inhalt der QuelleMonitoring of chemical product storage is a delicate operation in the sense that it requires knowledge of the nature of each stored product, their location, their interaction and possible actions to be implemented in case of emergency. To facilitate the storage management, this thesis proposes to use the concept of ambient where the product has its own information system and wireless communication so as to make it intelligent and autonomous. This thesis proposes and develops a model of internal behavior of active product that allows a distributed approach of active security. This can lead to a communication protocol of application level to embed the active products. This protocol is formally assessed using hierarchical colored Petri nets. Finally, this protocol is implemented in the simulator Castalia/Omnet++ to analyze it in several scenarios and also for the experience when going to scale. The results show the usefulness and feasibility of the concept of active product
Zouinkhi, Ahmed. „Contribution à la modélisation de produit actif communicant : spécification et évaluation d'un protocole de communication orienté sécurité des produits“. Electronic Thesis or Diss., Nancy 1, 2011. http://www.theses.fr/2011NAN10010.
Der volle Inhalt der QuelleMonitoring of chemical product storage is a delicate operation in the sense that it requires knowledge of the nature of each stored product, their location, their interaction and possible actions to be implemented in case of emergency. To facilitate the storage management, this thesis proposes to use the concept of ambient where the product has its own information system and wireless communication so as to make it intelligent and autonomous. This thesis proposes and develops a model of internal behavior of active product that allows a distributed approach of active security. This can lead to a communication protocol of application level to embed the active products. This protocol is formally assessed using hierarchical colored Petri nets. Finally, this protocol is implemented in the simulator Castalia/Omnet++ to analyze it in several scenarios and also for the experience when going to scale. The results show the usefulness and feasibility of the concept of active product