Dans cette thèse, nous nous attachons à étudier des classes de graphes infinis et leurs propriétés, Notamment celles de vérification de modèles, d'accessibilité et de langages reconnus.Nous définissons une notion d'arbres de piles ainsi qu'une notion liée de réécriture suffixe, permettant d'étendre à la fois les automates à piles d'ordre supérieur et la réécriture suffixe d'arbres de manière minimale. Nous définissons également une notion de reconnaissabilité sur les ensembles d'opérations à l'aide d'automates qui induit une notion de reconnaissabilité sur les ensembles d'arbres de piles et une notion de normalisation des ensembles reconnaissables d'opérations analogues à celles existant sur les automates à pile d'ordre supérieur. Nous montrons que les graphes définis par ces systèmes de réécriture suffixe d'arbres de piles possèdent une FO-théorie décidable, en montrant que ces graphes peuvent être obtenu par une interprétation à ensembles finis depuis un graphe de la hiérarchie à piles.Nous nous intéressons également au problème d'algébricité des langages de traces des systèmes à compteurs et au problème lié de la stratifiabilité d'un ensemble semi-linéaire. Nous montrons que dans le cas des polyèdres d'entiers, le problème de stratifiabilité est décidable et possède une complexité coNP-complète. Ce résultat nous permet ensuite de montrer que le problème d'algébricité des traces de systèmes à compteurs plats est décidable et coNP-complet. Nous donnons également une nouvelle preuve de la décidabilité des langages de traces des systèmes d'addition de vecteurs, préalablement étudié par Schwer / In this thesis, we study classes of infinite graphs and their properties,especially the model-checking problem, the accessibility problem and therecognised languages.We define a notion of stack trees, and a related notionof ground rewriting, which is an extension of both higher-order pushdownautomata and ground tree rewriting systems. We also define a notion ofrecognisability on the sets of ground rewriting operations through operationautomata. This notion induces a notion of recognisability over sets of stacktrees and a normalisation of recognisable sets of operations, similar to theknown notions over higher-order pushdown automata. We show that the graphsdefined by these ground stack tree rewriting systems have a decidableFO-theory, by exhibiting a finite set interpretation from a graph defined bya higher-order automaton to a graph defined by a ground stack tree rewritingsystem.We also consider the context-freeness problem for counter systems, andthe related problem of stratifiability of semi-linear sets. We prove thedecidability of the stratifiability problem for integral polyhedra and that itis coNP-complete. We use this result to show that the context-freeness problemfor flat counter systems is as well coNP-complete. Finally, we give a new proofof the decidability of the context-freeness problem for vector additionsystems, previously studied by Schwer

Computer systems are used in almost all aspects of our lives and our dependency on them keeps on increasing. When computer systems are used to handle critical tasks, any software failure can cause severe human and/or material losses. Therefore, for such applications, it is important to detect software errors at an early stage of software development. Furthermore, the growing use of concurrent and distributed programs exponentially increases the complexity of computer systems, making the problem of detecting software errors even harder (if not impossible). This calls for defining systematic and efficient techniques to evaluate the safety and the correctness of programs. The aim of Model-Checking is to analyze automatically whether a given program satisfies its specification. Early applications of Model-Checking were restricted to systems whose behaviors can be captured by finite graphs, so called finite-state systems. Since many computer systems cannot be modeled as finite-state machines, there has been a growing interest in extending the applicability of Model-Checking to infinite-state systems. The goal of this thesis is to extend the applicability of Model Checking for three instances of infinite-state systems: Ad-Hoc Networks, Dynamic Register Automata and Multi Pushdown Systems. Each one of these instances models challenging types of networks of communicating processes. In both Ad-Hoc Networks and Dynamic Register Automata, communication is carried through message passing. In each type of network, a graph topology models the communication links between processes in the network. The graph topology is static in the case of Ad-Hoc Networks while it is dynamic in the case of Dynamic Register Automata. The number of processes in both types of networks is unbounded. Finally, we consider Multi Pushdown Systems, a model used to study the behaviors of concurrent programs composed of sequential recursive sequential programs communicating through a shared memory.

Small signal oscillation has been always a major concern in the operation of power systems. In a generator, the electromechanical coupling between the rotor and the rest of the system causes it to behave in a manner similar to a spring mass damper system, which exhibits an oscillatory behaviour around the equilibrium state, following any disturbance, such as sudden change in loads, fluctuations in the output of turbine and faults etc. The use of fast acting high gain AVRs and evolution of large interconnected power systems with transfer of bulk power across weak transmission links have further aggravated the problem of these low frequency oscillations. Small oscillations in the range of about 0.1Hz to 3.5Hz can persist for long periods, limiting the power transfer capability of the transmission lines. Power System Stabilizers (PSS’s) were developed as auxiliary controllers on the generators excitation system to produce additional damping by modulating the generator excitation voltage. Designing effective PSS for all operating conditions specially in large interconnected power systems still remains a difficult and challenging task. The conventionally designed Power System Stabilizer (CPSS) is the most cost-effective electromechanical damping controller till date. However, continual changes in the operating condition and network parameters in large systems result in corresponding large changes in system dynamics. This constantly changing nature of power system makes the design of CPSS a difficult task. The design and tuning of PSS for robust operation is a laborious process. The existing PSS design techniques require considerable expertise, the complete system information and extensive eigenvalue calculations which increases the computational burden as the system size increases. This thesis proposes a method for designing robust power system damping controllers that ensures a minimum robustness under model uncertainties. The minimum performance required for the PSS is set a priori and accomplished over a range of operating conditions. A generalized robust controller design methodology has been first implemented on a Single Machine Infinite Bus (SMIB) power system model. The robust controller places the closed loop rotor modes of the system to the desire location while keeping the electrical modes intact. Unlike conventional lead/lag PSS design, the proposed PSS design is based on pole assignment technique which takes into account of various model uncertainties. For the proposed stabilizer design in a multi-machine systems a new decentralized method has been used which requires system data only upto secondary bus of the unit transformer in a generating station. The proposed robust controller design based on modified Nevanlinna-Pick theory has been designed and tested extensively on SMIB and multi-machine systems to establish the efficacy of the controller in damping small signal oscillations. The thesis is organized in four chapters as follows. The first chapter discusses the basic concepts related to the rotor angle stability in power system. The conventional and other methods of countering this instability by power system stabilizers have been described. The relative merits of the various stabilization techniques have been discussed. The scope of present work, i.e design of decentralized robust power system controllers has been defined. In second chapter a modified robust power system stabilizer for SMIB system is developed. It has been shown that under specific conditions the modified Nevanlinna-Pick theory can also be applied for designing damping controllers in system with lightly damped rotor modes. Third chapter proposes a decentralized approach based on modified Nevanlinna-Pick theory for designing a power system stabilizer for interconnected power systems. The performance of the controller which is not based on external system information has been investigated on three widely used multi-machine test systems to established its efficacy in damping out low frequency oscillations. The fourth chapter gives a brief summary of the work done and also includes a section on the scope of future work relating to design of power system stabilizers.

Gas separation with polymer membranes are becoming one of the mainstream separation techniques for a myriad of industrial applications. Membrane technologies are recognized as a viable and economical unit operation compared to more conventional separation processes. The design and material selection of membrane separation processes depends highly on the transport properties of separated gas molecules within the membrane material. Therefore, to use efficient methods for gas membrane characterization is paramount for the proper design of membrane separation processes. A membrane can be typically characterized by three main properties: permeability, solubility and diffusivity. The permeability of a membrane is the product of its diffusivity and solubility, therefore obtaining two of the three parameters is sufficient to fully characterize a membrane. The time-lag method is one of the oldest and most used gas membrane characterization methods. However, it suffers from various limitations that make the method not applicable for many types of membranes. The focus in this study was to develop new gas membrane characterization techniques that are based on extracting the membrane properties from the upstream gas pressure measurements rather than only from the downstream pressure measurements. It is believed that characterizing the membrane based on the upstream pressure measurements would be highly useful in characterizing barrier materials which are usually difficult to characterize using the conventional time-lag method. Moreover, glassy polymers which are widely used in industry exhibit behavior associated with nonlinear sorption isotherms and, therefore, the conventional time-lag method is incapable of obtaining an accurate estimation of glassy polymer properties. As a result, sorption experiments to generate a sorption isotherm are usually required in addition to permeation experiments to fully characterize glassy polymer membranes. To quantify the errors associated with the conventional time-lag assumptions and to fundamentally comprehend the impact of nonlinearities on the time-lag method, a comprehensive numerical investigation has been undertaken using the finite difference method. The investigation has clearly put in evidence the effect of the various Langmuir parameters on the accuracy of the time lag and on the time required to achieve steady state. This investigation also allowed assessing the errors associated with the usual assumptions made on the boundary conditions in determining the time lag. In this study, three novel gas membrane characterization methods were developed and proposed. Two of the proposed methods are concerned with the characterization of membranes that can be represented with a linear sorption isotherm. These two methods are entirely based on the upstream pressure measurements. The third membrane characterization method that is proposed is based on the dynamic monitoring of both upstream and downstream pressure measurements and is applicable to systems that exhibit a nonlinear isotherm sorption behavior. The three proposed methods are promising and further experimental validation is recommended to determine their full range of applicability.

Les techniques d’optimisation non-lisse permettent de résoudre des problèmes difficiles de l’ingénieur automaticien qui étaient inaccessibles avec les techniques classiques. Il s’agit en particulier de problèmes de commande ou de filtrage impliquant de multiples modèles ou faisant intervenir des contraintes de structure pour la réduction des couts et de la complexité. Il en résulte que ces techniques sont plus à même de fournir des solutions réalistes dans des problématiques pratiques difficiles. Les industriels européens de l’aéronautique et de l’espace ont récemment porté un intérêt tout particulier à ces nouvelles techniques. Ces dernières font parfois partie du "process" industriel (THALES, AIRBUS DS Satellite, DASSAULT A) ou sont utilisées dans les bureaux d’étude: (SAGEM, AIRBUS Transport). Des études sont également en cours comme celle concernant le pilotage atmosphérique des futurs lanceurs tels d’Ariane VI. L’objectif de cette thèse concerne l'exploration, la spécialisation et le développement des techniques et outils de l'optimisation non-lisse pour des problématiques d'ingénierie non résolues de façon satisfaisante - incertitudes de différente nature - optimisation de l'observabilité et de la contrôlabilité - conception simultanée système et commande Il s’agit aussi d’évaluer le potentiel de ces techniques par rapport à l’existant avec comme domaines applicatifs l’aéronautique, le spatial ou les systèmes de puissance de grande dimension qui fournissent un cadre d’étude particulièrement exigeant. / Non-smooth optimization techniques help solving difficult engineering problems that would be unsolvable otherwise. Among them, control problems with multiple models or with constraints regarding the structure of the controller. The thesis objectives consist in the exploitation, specialization and development of non smooth optmization techniques and tools for solving engineering problems that are not satisfactorily solved to the present.

Cette thèse contient des contributions originales à la théorie du Contrôle Optimal en temps discret et en horizon infini du point de vue de Pontryagin. Il y a 5 chapitres dans cette thèse. Dans le chapitre 1, nous rappelons des résultats préliminaires sur les espaces de suites à valeur dans et des résultats de Calcul Différentiel. Dans le chapitre 2, nous étudions le problème de Contrôle Optimal, en temps discret et en horizon infini avec la contrainte asymptotique et avec le système autonome. En utilisant la structure d'espace affine de Banach de l'ensemble des suites convergentes vers 0, et la structure d'espace vectoriel de Banach de l'ensemble des suites bornées, nous traduisons ce problème en un problème d'optimisation statique dam des espaces de Banach. Après avoir établi des résultats originaux sur les opérateurs de Nemytskii sur les espaces de suites et après avoir adapté à notre problème un théorème d'existence de multiplicateurs, nous établissons un nouveau principe de Pontryagin faible pour notre problème. Dans le chapitre 3, nous établissons un principe de Pontryagin fort pour les problèmes considérés au chapitre 2 en utilisant un résultat de Ioffe-Tihomirov. Le chapitre 4 est consacré aux problèmes de Contrôle Optimal, en temps discret et en horizon infini, généraux avec plusieurs critères différents. La méthode utilisée est celle de la réduction à l'horizon fini, initiée par J. Blot et H. Chebbi en 2000. Les problèmes considérés sont gouvernés par des équations aux différences ou des inéquations aux différences. Un nouveau principe de Pontryagin faible est établi en utilisant un résultat récent de J. Blot sur les multiplicateurs à la Fritz John. Le chapitre 5 est consacré aux problèmes multicritères de Contrôle Optimal en temps discret et en horizon infini. De nouveaux principes de Pontryagin faibles et forts sont établis, là-aussi en utilisant des résultats récents d'optimisation, sous des hypothèses plus faibles que celles des résultats existants. / This thesis contains original contributions to the optimal control theory in the discrete-time framework and in infinite horizon following the viewpoint of Pontryagin. There are 5 chapters in this thesis. In Chapter 1, we recall preliminary results on sequence spaces and on differential calculus in normed linear space. In Chapter 2, we study a single-objective optimal control problem in discrete-time framework and in infinite horizon with an asymptotic constraint and with autonomous system. We use an approach of functional analytic for this problem after translating it into the form of an optimization problem in Banach (sequence) spaces. Then a weak Pontyagin principle is established for this problem by using a classical multiplier rule in Banach spaces. In Chapter 3, we establish a strong Pontryagin principle for the problems considered in Chapter 2 using a result of Ioffe and Tihomirov. Chapter 4 is devoted to the problems of Optimal Control, in discrete time framework and in infinite horizon, which are more general with several different criteria. The used method is the reduction to finite-horizon initiated by J. Blot and H. Chebbi in 2000. The considered problems are governed by difference equations or difference inequations. A new weak Pontryagin principle is established using a recent result of J. Blot on the Fritz John multipliers. Chapter 5 deals with the multicriteria optimal control problems in discrete time framework and infinite horizon. New weak and strong Pontryagin principles are established, again using recent optimization results, under lighter assumptions than existing ones.

We study nonlinear stability of steady state solutions of partial differential equations governing the thermomechanical evolution of viscoelastic fluids; materials that exhibit both viscous as well as elastic response when undergoing deformation. It is well-known that thermodynamical concepts can be gainfully exploited in the construction of Lya- punov functionals for nonlinear stability analysis of spatially homogeneous equilibrium rest states in thermodynamically closed systems. We show that the thermodynamically oriented approach can be utilized in the nonlinear stability analysis of spatially inhomo- geneous non-equilibrium steady states in thermodynamically open systems as well. The thesis consists of two parts. In the first part, we revisit the classical construction of Lyapunov functionals in thermodynamically closed systems and we apply the nonlinear stability theory to compressible heat-conducting viscoelastic fluids modeled by a multi- scale, as well as a purely macroscopic approach. In the second part, we focus on two special instances of thermodynamically open systems. First, we show that the spatially inhomogeneous non-equilibrium steady state of an incompressible heat-conducting vis- coelastic fluid, which occupies a mechanically isolated vessel with walls kept at spatially non-uniform...

Inspired by problems in gauge field theory, this thesis is concerned with various aspects of infinite-dimensional differential geometry. In the first part, a local normal form theorem for smooth equivariant maps between tame Fréchet manifolds is established. Moreover, an elliptic version of this theorem is obtained. The proof these normal form results is inspired by the Lyapunov–Schmidt reduction for dynamical systems and by the Kuranishi method for moduli spaces, and uses a slice theorem for Fréchet manifolds as the main technical tool. As a consequence of this equivariant normal form theorem, the abstract moduli space obtained by factorizing a level set of the equivariant map with respect to the group action carries the structure of a Kuranishi space, i.e., such moduli spaces are locally modeled on the quotient by a compact group of the zero set of a smooth map. In the second part of the thesis, the theory of singular symplectic reduction is developed in the infinite-dimensional Fréchet setting. By refining the above construction, a normal form for momentum maps similar to the classical Marle–Guillemin–Sternberg normal form is established. Analogous to the reasoning in finite dimensions, this normal form result is then used to show that the reduced phase space decomposes into smooth manifolds each carrying a natural symplectic structure. Finally,the singular symplectic reduction scheme is further investigated in the situation where the original phase space is an infinite-dimensional cotangent bundle. The fibered structure of the cotangent bundle yields a refinement of the usual orbit-momentum type strata into so-called seams. Using a suitable normal form theorem, it is shown that these seams are manifolds. Taking the harmonic oscillator as an example, the influence of the singular seams on dynamics is illustrated. The general results stated above are applied to various gauge theory models. The moduli spaces of anti-self-dual connections in four dimensions and of Yang–Mills connections in two dimensions is studied. Moreover, the stratified structure of the reduced phase space of the Yang–Mills–Higgs theory is investigated in a Hamiltonian formulation after a (3 + 1)-splitting.

The tenser analyzing power T-20 and the polarization transfer kappa in the deuteron break-up reaction Dp --> pX are calculated within a relativistic approach based on the Bethe-Salpeter equation with a realistic meson-exchange potential. Our results on T-20, kappa and the cross section are compared with experimental data and non-relativistic calculations and with the outcome of a relativization procedure of the deuteron wave function.

Disertační práce se zabývá asymptotickou stabilitou zpožděných diferenciálních rovnic a jejich diskretizací. V práci jsou uvažovány lineární zpožděné diferenciální rovnice s~konstantním i neohraničeným zpožděním. Jsou odvozeny nutné a postačující podmínky popisující oblast asymptotické stability jak pro exaktní, tak i diskretizovanou lineární neutrální diferenciální rovnici s konstantním zpožděním. Pomocí těchto podmínek jsou porovnány oblasti asymptotické stability odpovídajících exaktních a diskretizovaných rovnic a vyvozeny některé vlastnosti diskrétních oblastí stability vzhledem k měnícímu se kroku použité diskretizace. Dále se zabýváme lineární zpožděnou diferenciální rovnicí s neohraničeným zpožděním. Je uveden popis jejích exaktních a diskrétních oblastí asymptotické stability spolu s asymptotickým odhadem jejich řešení. V závěru uvažujeme lineární diferenciální rovnici s více neohraničenými zpožděními.