Duflot, Marie (1977....).
Overview
Works:  5 works in 5 publications in 2 languages and 36 library holdings 

Roles:  Author of introduction, Opponent, Author 
Publication Timeline
.
Most widely held works by
Marie Duflot
Jeux et graphes : la théorie des graphes de 5 à 95 ans by
Alain Busser(
Book
)
1 edition published in 2020 in French and held by 33 WorldCat member libraries worldwide
La 4e de couverture indique : "Les graphes sont très peu présents au second degré ("maths expertes" et "NSI" en terminale, "SNT" en seconde) et pas du tout au primaire. Cette situation est paradoxale : comprendre les graphes est immédiat dès qu'on sait en dessiner, en colorier ou déplacer un (ou plusieurs) pion sur le graphe. Autrement dit, tout élève lecteur peut découvrir le monde des graphes. L'étymologie de "graphe" évoque les élèves "visuels", mais les graphes intéressent aussi les "kinesthésiques". La théorie des graphes, atypique, permet une réconciliation avec les maths : les graphes sont des objets mathématiques mais n'en ont pas autant l'air que par exemple des figures géométriques ou des nombres. Dans ce livre, des exemples de graphes (souvent issus du monde ludique) et des notions de théorie des graphes sont exposés, souvent par le jeu et la manipulation. Si vous enseignez les maths expertes ou NSI en Terminale, ce livre peut vous apporter des exemples d'exercices. Un chapitre est consacré à des notions vues en SNT. Si vous enseignez les mathématiques (de la grande section au postbac), ce livre vous apporte des exemples de problèmes (dont certains sont ouverts) sur les graphes, permettant de déconnecter l'activité de résolution de problème, de connaissances qui ne sont ici pas nécessaires. Si vous êtes parents d'élèves lecteurs, vous trouverez dans ce livre de quoi animer des soirées ludomathématiques avec vos enfants."
1 edition published in 2020 in French and held by 33 WorldCat member libraries worldwide
La 4e de couverture indique : "Les graphes sont très peu présents au second degré ("maths expertes" et "NSI" en terminale, "SNT" en seconde) et pas du tout au primaire. Cette situation est paradoxale : comprendre les graphes est immédiat dès qu'on sait en dessiner, en colorier ou déplacer un (ou plusieurs) pion sur le graphe. Autrement dit, tout élève lecteur peut découvrir le monde des graphes. L'étymologie de "graphe" évoque les élèves "visuels", mais les graphes intéressent aussi les "kinesthésiques". La théorie des graphes, atypique, permet une réconciliation avec les maths : les graphes sont des objets mathématiques mais n'en ont pas autant l'air que par exemple des figures géométriques ou des nombres. Dans ce livre, des exemples de graphes (souvent issus du monde ludique) et des notions de théorie des graphes sont exposés, souvent par le jeu et la manipulation. Si vous enseignez les maths expertes ou NSI en Terminale, ce livre peut vous apporter des exemples d'exercices. Un chapitre est consacré à des notions vues en SNT. Si vous enseignez les mathématiques (de la grande section au postbac), ce livre vous apporte des exemples de problèmes (dont certains sont ouverts) sur les graphes, permettant de déconnecter l'activité de résolution de problème, de connaissances qui ne sont ici pas nécessaires. Si vous êtes parents d'élèves lecteurs, vous trouverez dans ce livre de quoi animer des soirées ludomathématiques avec vos enfants."
Un cadre formel pour l'intégration de connaissances du domaine dans la conception des systèmes : application au formalisme
EventB by
Souad Kherroubi(
)
1 edition published in 2018 in French and held by 1 WorldCat member library worldwide
This thesis aims at defining techniques to better exploit the knowledge provided from the domain in order to account for the reality of systems described as complex and critical. Modeling is an essential step in performing verifications and expressing properties that a system must satisfy according to the needs and requirements established in the specifications. Modeling is a representation that simplifies the reality of a system. However, a complex system can not be reduced to a model. A model that represents a system must always fit into its observational theory to account for any anomalies that it may contain. Our study clearly shows that the context is the first issue to deal with as the main source of conflict in the design process of a system. The approach adopted in this thesis is that of integrating knowledge of the domain by associating the system to design with declarative formalisms qualified of descriptive ones that we call ontologies. We pay a particular attention to the EventB formalism, whose correctbyconstruction approach called refinement is the main mechanism at the heart of this formalism, which makes it possible to make proofs on abstract representations of systems for expressing and verifying properties of safety and invariance. The first problem treated is the representation and modeling of contextual knowledge in V&V of models. Following to the study looked at the different sources of conflict, we established new definitions and rules for a refinement context knowledge extraction for EventB V&V. A study of logical formalisms that represent and interpret the context allowed us to define a new mechanism for better structuring EventB models. A second study concerns the contribution that domain knowledge can make to the V&V of models. We define a logic for the EventB formalism with domain constraints based on the description logic, and we define rules to integrate domain knowledge for model V&V. The evaluation of the proposals made deal with very complex case studies such as voting systems whose design patterns are also developed in this thesis. We raise fundamental issues about the complementarity that the integration of domain knowledge can bring to EventB models by refinement using ontological reasoning, and we propose to define a new structures for a partially automated extraction on both levels, namely the V&V
1 edition published in 2018 in French and held by 1 WorldCat member library worldwide
This thesis aims at defining techniques to better exploit the knowledge provided from the domain in order to account for the reality of systems described as complex and critical. Modeling is an essential step in performing verifications and expressing properties that a system must satisfy according to the needs and requirements established in the specifications. Modeling is a representation that simplifies the reality of a system. However, a complex system can not be reduced to a model. A model that represents a system must always fit into its observational theory to account for any anomalies that it may contain. Our study clearly shows that the context is the first issue to deal with as the main source of conflict in the design process of a system. The approach adopted in this thesis is that of integrating knowledge of the domain by associating the system to design with declarative formalisms qualified of descriptive ones that we call ontologies. We pay a particular attention to the EventB formalism, whose correctbyconstruction approach called refinement is the main mechanism at the heart of this formalism, which makes it possible to make proofs on abstract representations of systems for expressing and verifying properties of safety and invariance. The first problem treated is the representation and modeling of contextual knowledge in V&V of models. Following to the study looked at the different sources of conflict, we established new definitions and rules for a refinement context knowledge extraction for EventB V&V. A study of logical formalisms that represent and interpret the context allowed us to define a new mechanism for better structuring EventB models. A second study concerns the contribution that domain knowledge can make to the V&V of models. We define a logic for the EventB formalism with domain constraints based on the description logic, and we define rules to integrate domain knowledge for model V&V. The evaluation of the proposals made deal with very complex case studies such as voting systems whose design patterns are also developed in this thesis. We raise fundamental issues about the complementarity that the integration of domain knowledge can bring to EventB models by refinement using ontological reasoning, and we propose to define a new structures for a partially automated extraction on both levels, namely the V&V
Algorithmes distribués sur des anneaux paramétrés : preuves de convergence probabiliste et déterministe by
Marie Duflot(
Book
)
in French and held by 1 WorldCat member library worldwide
The subject of this thesis concerns verification of distributed systems. More precisely, we focus on proving convergence of distributed algorithms running on ring networks whose size is a parameter. Moreover, our work has been done both for deterministic and probabilistic algorithms
in French and held by 1 WorldCat member library worldwide
The subject of this thesis concerns verification of distributed systems. More precisely, we focus on proving convergence of distributed algorithms running on ring networks whose size is a parameter. Moreover, our work has been done both for deterministic and probabilistic algorithms
Évaluation de la fiabilité des systèmes modélisés par arbres de défaillances grâce aux techniques de satisfiabilité by
Margaux Duroeulx(
)
1 edition published in 2020 in French and held by 1 WorldCat member library worldwide
This thesis focuses on designing critical systems, those functioning is impacted by failures that could be dangerous for goods and people. During its design, it is crucial to convey a dependability analysis in order to determine the potential failures, their criticity and their probability of occurrence. The aim of this thesis is to involve satisfiability techniques in the computation of the reliability of the system: its probability to ensure its mission for a given time. In the first part, we consider static systems, those for which the functioning only depends on the functioning of their components functioning. We model the system by a fault tree, which is a widespread modeling tool in the reliability community, from which we can obtain the structure function. The structure function is a formula describing the combinations of components failure which are tolerated or not by the system. We also model the system by a Hasse diagram, which represents the states of the system depending on the states of the components. The probabilistic assessment of the trust placed to the system is based on the reliability function determined from the Hasse diagram. In the second part, we consider dynamic systems, for which the order between failures has an impact on the system. For example, it is the case for electric generators, which deprive the other components of electricity when they fail. In order to adapt to dynamic systems, the approach developed of the first part, we define minimal tie set sequences as the extension of minimal tie sets for dynamic systems, and we compute them by using satisfiability techniques. We also propose an adaptation of Hasse diagrams for dynamic systems to determine the reliability function
1 edition published in 2020 in French and held by 1 WorldCat member library worldwide
This thesis focuses on designing critical systems, those functioning is impacted by failures that could be dangerous for goods and people. During its design, it is crucial to convey a dependability analysis in order to determine the potential failures, their criticity and their probability of occurrence. The aim of this thesis is to involve satisfiability techniques in the computation of the reliability of the system: its probability to ensure its mission for a given time. In the first part, we consider static systems, those for which the functioning only depends on the functioning of their components functioning. We model the system by a fault tree, which is a widespread modeling tool in the reliability community, from which we can obtain the structure function. The structure function is a formula describing the combinations of components failure which are tolerated or not by the system. We also model the system by a Hasse diagram, which represents the states of the system depending on the states of the components. The probabilistic assessment of the trust placed to the system is based on the reliability function determined from the Hasse diagram. In the second part, we consider dynamic systems, for which the order between failures has an impact on the system. For example, it is the case for electric generators, which deprive the other components of electricity when they fail. In order to adapt to dynamic systems, the approach developed of the first part, we define minimal tie set sequences as the extension of minimal tie sets for dynamic systems, and we compute them by using satisfiability techniques. We also propose an adaptation of Hasse diagrams for dynamic systems to determine the reliability function
Randomized dining philosophers without fairness assumption by
Marie Duflot(
)
1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Busser, Alain Author
 Université de Lorraine Degree grantor
 École doctorale IAEM Lorraine  Informatique, Automatique, Électronique  Électrotechnique, Mathématiques de Lorraine Other
 Laboratoire lorrain de recherche en informatique et ses applications Other
 Kherroubi, Souad (1982....). Author
 Méry, Dominique Thesis advisor
 Faure, JeanMarc (1976....). Other
 Duroeulx, Margaux (1994....). Author
 Bellatreche, Ladjel Other Opponent
 Laleau, Régine (19......). Other