Concurrent process and combinatorics of increasingly labeled structures : quantitative analysis and random generation algorithms ; Processus concurrents et combinatoire des structures croissantes : analyse quantitative et algorithmes de génération aléatoire
Uloženo v:
| Název: | Concurrent process and combinatorics of increasingly labeled structures : quantitative analysis and random generation algorithms ; Processus concurrents et combinatoire des structures croissantes : analyse quantitative et algorithmes de génération aléatoire |
|---|---|
| Autoři: | Dien, Matthieu |
| Přispěvatelé: | Algorithmes, Programmes et Résolution (APR), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Université Pierre et Marie Curie - Paris VI, Antoine Genitrini, Michèle Soria, Frédéric Peschanski |
| Zdroj: | https://theses.hal.science/tel-01678893 ; Data Structures and Algorithms [cs.DS]. Université Pierre et Marie Curie - Paris VI, 2017. English. ⟨NNT : 2017PA066210⟩. |
| Informace o vydavateli: | CCSD |
| Rok vydání: | 2017 |
| Témata: | Random generation, Analytic combinatorics, Concurrency theory, Combinatoire analytique, Théorie de la concurrence, Génération aléatoire, Série-parallèle, Structures croissantes, Ordre partiel, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS] |
| Popis: | A concurrent program is a composition of several logical blocks: the processes. Each process has its own behavior, independent from the others: it sequentially runs its actions. An important goal is to ensure that such concurrent complex systems are faultless. This problem is studied in the field of concurrency theory. When several process are running in parallel, the running order of the actions of the total program is no more decided. This is the well-known "combinatorial explosion" phenomena, meaning that the number of possible runs of the global program is huge. The analysis techniques and methods existing (model checking, static analysis, automated testing, etc) are irremediably limited by this "explosion". This thesis is a part of a long-term project about the quantitative study of this phenomena and the development of statistic analysis methods based on the uniform random generation. Our specific goal is to study a fundamental principle of the concurrency theory: the synchronization. This mechanism allows communications between the processes. In this thesis we propose a combinatorial model of increasingly labeled structures to deal with runs of synchronized concurrent programs. Using the tools of analytic combinatorics we obtain close formulas and asymptotic equivalents for the average number of runs in several subclasses of concurrent programs. We also present algorithms of uniform random generation of increasingly labeled structures and for their increasing labelings. ; Un programme concurrent est composé de plusieurs unités logiques : les processus. Chaque processus a un comportement qui lui est propre : il exécute ses actions de façon séquentielle. Un objectif important est de s'assurer que de tels systèmes concurrents complexes soient cependant exempts de défaut. Cette problématique est étudiée dans le cadre de la théorie de la concurrence. Quand plusieurs processus s’exécutent en parallèle, l’ordre d’exécution des actions du programme global n’est plus déterminé. On assiste au fameux phénomène ... |
| Druh dokumentu: | doctoral or postdoctoral thesis |
| Jazyk: | English |
| Relation: | NNT: 2017PA066210 |
| Dostupnost: | https://theses.hal.science/tel-01678893 https://theses.hal.science/tel-01678893v2/document https://theses.hal.science/tel-01678893v2/file/these_archivage_2901294o.pdf |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Přístupové číslo: | edsbas.11BADBF7 |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | A concurrent program is a composition of several logical blocks: the processes. Each process has its own behavior, independent from the others: it sequentially runs its actions. An important goal is to ensure that such concurrent complex systems are faultless. This problem is studied in the field of concurrency theory. When several process are running in parallel, the running order of the actions of the total program is no more decided. This is the well-known "combinatorial explosion" phenomena, meaning that the number of possible runs of the global program is huge. The analysis techniques and methods existing (model checking, static analysis, automated testing, etc) are irremediably limited by this "explosion". This thesis is a part of a long-term project about the quantitative study of this phenomena and the development of statistic analysis methods based on the uniform random generation. Our specific goal is to study a fundamental principle of the concurrency theory: the synchronization. This mechanism allows communications between the processes. In this thesis we propose a combinatorial model of increasingly labeled structures to deal with runs of synchronized concurrent programs. Using the tools of analytic combinatorics we obtain close formulas and asymptotic equivalents for the average number of runs in several subclasses of concurrent programs. We also present algorithms of uniform random generation of increasingly labeled structures and for their increasing labelings. ; Un programme concurrent est composé de plusieurs unités logiques : les processus. Chaque processus a un comportement qui lui est propre : il exécute ses actions de façon séquentielle. Un objectif important est de s'assurer que de tels systèmes concurrents complexes soient cependant exempts de défaut. Cette problématique est étudiée dans le cadre de la théorie de la concurrence. Quand plusieurs processus s’exécutent en parallèle, l’ordre d’exécution des actions du programme global n’est plus déterminé. On assiste au fameux phénomène ... |
|---|