Thèses sur le sujet « Parameterised systems »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Parameterised systems ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Kouvaros, Panagiotis. « Parameterised verification for multi-agent systems ». Thesis, Imperial College London, 2015. http://hdl.handle.net/10044/1/33793.
Texte intégralHouhou, Sara. « Parameterised Verification from Formal Specifications of Information Systems ». Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS421.
Texte intégralBusiness process models verification is crucial to detect possible errors at design time, rather than at execution on business process engines. BPMN is the primary notation for business process modelling. It is an ISO standard, widely used both in education and in industry. The semantics of BPMN are however defined in a semi-formal way within the standard. This is why many works have tackled the definition of formal semantics for BPMN. In this thesis, we first provided a detailed study of the main works relating to the verification of BPMN models. This allowed us to identify several fragments of the notation which are often put aside in the work of formalization, such as the different models of communication, the temporal management, or the multi-instance character. These aspects are however crucial for the extension of the field of application of BPMN to frameworks such as the Internet of Things or the Factory of the Future. We then defined an approach for the verification of business process collaboration models that supports several of these perspectives, namely the different communication models and time constraints. For this, we have defined formal execution semantics, in terms of first-order logic, to the BPMN fragment taken into account. We then defined implementations of this semantics in the formal languages TLA + and Alloy. Finally, this enabled the models to be verified using tools dedicated to these formal languages. Our approach is supported by a tool, fbpmn, allowing the formal transformation of BPMN models to TLA + and Alloy, the verification of models, and the animation of counter-examples when the properties to be verified are not satisfied. This feedback is done directly on the initial BPMN model which makes the approach practicable in a context of use by non-specialists of formal methods. A web application has also been developed to make it even easier to apply our formal approach in an industrial setting. Our tools, our TLA + and Alloy formal semantics implementations, and our library of examples are open sources and available online
Graham, Douglas. « Parameterised verification of randomised distributed systems using state-based models ». Thesis, Connect to e-thesis, 2008. http://theses.gla.ac.uk/95/.
Texte intégralPh.D. thesis submitted to the Faculty of Information and Mathematical Sciences, University of Glasgow, 2008. Includes bibliographical references. Print version also available.
Lehaut, Mathieu. « Synthesis for parameterized systems ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS341.
Texte intégralIn this thesis, we study the synthesis problem for distributed systems where the number of participants is not known in advance and in which all participants interact with an uncontrollable environment. The synthesis problem is about automatically generating a program for such a system that would be correct by construction for a given specification, if such a program exist. We also study the closely related control problem, whose goal is generating a controller for a partially defined system such that all behaviors generated are correct with respect to the specification
Peach, Nigel G. « Bearings only tracking using a set of range parameterised extended Kalman filters ». Thesis, University of Bath, 1997. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362303.
Texte intégralMahata, Pritha. « Model Checking Parameterized Timed Systems ». Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis : Univ.-bibl. [distributör], 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4835.
Texte intégralMalak, Richard J. Jr. « Using parameterized efficient sets to model alternatives for systems design decisions ». Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26697.
Texte intégralCommittee Chair: Paredis, Christiaan J.J.; Committee Member: Bras, Bert; Committee Member: Choudhary, Ruchi; Committee Member: McGinnis, Leon; Committee Member: Rosen, David. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Ben, Henda Noomene. « Infinite-state Stochastic and Parameterized Systems ». Doctoral thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8915.
Texte intégralA major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization.
Systems with unbounded data structure are natural models for reasoning about communication protocols, concurrent programs, real-time systems, etc. While parameterized systems are more suitable if the system consists of an arbitrary number of identical processes which is the case for cache coherence protocols, distributed algorithms and so forth.
In this thesis, we consider model checking problems for certain fundamental classes of probabilistic infinite-state systems, as well as the verification of safety properties in parameterized systems. First, we consider probabilistic systems with unbounded data structures. In particular, we study probabilistic extensions of Lossy Channel Systems (PLCS), Vector addition Systems with States (PVASS) and Noisy Turing Machine (PNTM). We show how we can describe the semantics of such models by infinite-state Markov chains; and then define certain abstract properties, which allow model checking several qualitative and quantitative problems.
Then, we consider parameterized systems and provide a method which allows checking safety for several classes that differ in the topologies (linear or tree) and the semantics (atomic or non-atomic). The method is based on deriving an over-approximation which allows the use of a symbolic backward reachability scheme. For each class, the over-approximation we define guarantees monotonicity of the induced approximate transition system with respect to an appropriate order. This property is convenient in the sense that it preserves upward closedness when computing sets of predecessors.
Kojić, Aleksandar M. 1974. « Parameter estimation in nonlinearly parameterized systems ». Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47637.
Texte intégralRezine, Ahmed. « Parameterized Systems : Generalizing and Simplifying Automatic Verification ». Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8587.
Texte intégralBherer, Hans. « Controller Synthesis for Parameterized Discrete Event Systems ». Thesis, Université Laval, 2009. http://www.theses.ulaval.ca/2009/26696/26696.pdf.
Texte intégralDiscrete event systems are a special type of dynamic systems. The state of these systems changes only at discrete instants of time and the term event is used to represent the occurrence of discontinuous changes. These systems are mostly man-made and arise in the domains of manufacturing systems, traffic systems, database management systems and communication protocols. This thesis investigates the control of parameterized discrete event systems when specifications are given in terms of predicates and satisfy a similarity assumption. For systems consisting of similar processes under total or partial observation, conditions are given to deduce properties of a system of n processes from properties of a system of n0 processes, with n ≥ n0. Furthermore, it is shown how to infer a control policy for the former from the latter’s, while taking into account interconnections between processes. This study is motivated by a weakness in current synthesis methods that do not scale well to huge systems.
Majumdar, Anirban. « Verification and synthesis of parameterized concurrent systems ». Electronic Thesis or Diss., université Paris-Saclay, 2021. http://www.theses.fr/2021UPASG059.
Texte intégralThis thesis is at the crossroad of verification and synthesis of parameterized concurrent systems. The parameterized model checking problem asks whether a system satisfies a given specification independently of the number of its components, whereas synthesis requires an algorithmic design of protocols for its components so that the specification is satisfied.We study a parameterized model of networks where processes are distributed over an undirected graph, running the same broadcast protocol, and communicating via selective broadcasts of messages. The coverability problem asks whether a given state of the protocol is coverable. We show that for positive instances of the coverability problem in reconfigurable semantics, the size (cutoff) and the length (covering length) of a minimal covering execution is linearly and quadratically bounded, respectively. We introduce loss-on-broadcast semantics, and show similar bounds for the cutoff and the covering length.The interactions between agents can be modelled using games. We introduce and study two different settings of the so-called parameterized concurrent games, a model of concurrent games with arbitrarily many agents. First, we consider a scenario of a distinguished player Eve trying to achieve a goal against arbitrarily many opponents, irrespective of their strategies. We prove the existence of a winning strategy for Eve is decidable, and show tight complexity bounds for reachability objectives. Second, we consider a coalition game where all players collectively try to achieve a common goal. We consider safety objectives and show the existence of a winning coalition strategy is decidable, and prove complexity bounds for the same
Haydar, May. « Parameterized events for designing real-time reactive systems ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59324.pdf.
Texte intégralSävström, Tomas. « Small Model Theorems for Verification of Parameterized Systems ». Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-244347.
Texte intégralBond, Bradley N. (Bradley Neil). « Parameterized model order reduction for nonlinear dynamical systems ». Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37935.
Texte intégralIncludes bibliographical references (p. 67-70).
The presence of several nonlinear analog circuits and Micro-Electro-Mechanical (MEM) components in modern mixed signal System-on-Chips (SoC) makes the fully automatic synthesis and optimization of such systems an extremely challenging task. The research presented in this thesis concerns the development of techniques for generating Parameterized Reduced Order Models (PROMs) of nonlinear dynamical systems. Such reduced order models could serve as a first step towards the automatic and accurate characterization of geometrically complex components and subcircuits, eventually enabling their synthesis and optimization. This work combines elements from a non-parameterized trajectory piecewise linear method for nonlinear systems with a moment matching paramneterized technique for linear systems. Exploiting these two methods one can create four different algorithms or generating PROMs of nonlinear systems. The algorithms were tested on three different systems: a MEM switch and two nonlinear analog circuits. All three examples contain distributed strong nonlinearities and possess dependence on several geometric parameters.
(cont.) Using the proposed algorithms, the local and global parameter-space accuracy of the reduced order models can be adjusted as desired. Models call be created which are extremely accurate over a narrow range of parameter values. as well as models which are less accurate locally but still provide adequate accuracy over a much wider range of parameter values.
by Bradley N. Bond.
S.M.
Cao, Chengyu 1973. « Parameter estimation and control of nonlinearly parameterized systems ». Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/30326.
Texte intégralIncludes bibliographical references.
Parameter estimation in nonlinear systems is an important issue in measurement, diagnosis and modeling. The goal is to find a differentiator free on-line adaptive estimation algorithm which can estimate the internal unknown parameters of dynamic systems using its inputs and outputs. This thesis provides new algorithms for adaptive estimation and control of nonlinearly parameterized (NLP) systems. First, a Hierarchical Min-max algorithm is invented to estimate unknown parameters in NLP systems. To relax the strong condition needed for the convergence in Hierarchical Min-max algorithm, a new Polynomial Adaptive Estimator (PAE) is invented and the Nonlinearly Persistent Excitation Condition for NLP systems, which is no more restrictive than LPE for linear systems, is established for the first time. To reduce computation complexity of PAE, a Hierarchical PAE is proposed. Its performance in the presence of noise is evaluated and is shown to lead to bounded errors. A dead-zone based adaptive filter is also proposed and is shown to accurately estimate the unknown parameters under some conditions. Based on the adaptive estimation algorithms above, a Continuous Polynomial Adaptive Controller (CPAC) is developed and is shown to control systems with nonlinearities that have piece-wise linear parameterizations. Since large classes of nonlinear systems can be approximated by piece-wise linear functions through local linearization, it opens the door for adaptive control of general NLP systems. The robustness of CPAC under bounded output noise and disturbances is also established.
by Chengyu Cao.
Ph.D.
Jahundovics, Vladislavs. « Automatic Verification of Parameterized Systems by Over-Approximation ». Licentiate thesis, Linköpings universitet, Institutionen för datavetenskap, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-121776.
Texte intégralBRADDE, TOMMASO. « Parameterized macromodeling of passive and active dynamical systems ». Doctoral thesis, Politecnico di Torino, 2022. http://hdl.handle.net/11583/2970988.
Texte intégralChan, Brendan K. « Hyperboloid-Parameterized Description of Diffusive Superconducting-Magnetic Hybrid Systems ». Thesis, California State University, Long Beach, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10606400.
Texte intégralWe present a study of diffusive Josephson junctions made of two superconductors connected by a magnetic heterostructure. When the link is sufficiently thin, Cooper pairs can tunnel from one superconductor to the other, generating a Josephson current. Junctions with inhomogeneous magnetization are of particular interest because they may display triplet pair correlations with non-zero spin projection along the quantization axis. The generation of these correlations in the hybrid structure is studied by solving numerically the Usadel equations. In previous works, we have shown for example that the rotation of the magnetization can be used to tune the relative weight of the singlet and triplet pair correlations, thereby tuning the current. Here we present a novel approach to the numerical treatment of the Usadel equations, using a parameterization that takes automatically into account a required constraint of the model. The method significantly reduces the computational time, allowing us to calculate the Gor'kov functions self-consistently and extend the model to include the inverse proximity effect. We show results for SF and SFS systems with a helical magnetization profile for various twisting angles.
KojiÄ, Aleksandar M. 1974. « Global parameter identification and control of nonlinearly parameterized systems ». Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/8330.
Texte intégralIncludes bibliographical references (leaves 109-114).
Nonlinearly parameterized (NLP) systems are ubiquitous in nature and many fields of science and engineering. Despite the wide and diverse range of applications, there exist relatively few results in control systems literature which exploit the structure of the nonlinear parameterization. A vast majority of presently applicable global control design approaches to systems with NLP, make use of either feedback-linearization, or assume linear parameterization, and ignore the specific structure of the nonlinear parameterization. While this type of approach may guarantee stability, it introduced three major drawbacks. First, they produce no additional information about the nonlinear parameters. Second, they may require large control authority and actuator bandwidth, which makes them unsuitable for some applications. Third, they may simply result in unacceptably poor performance. All of these inadequacies are amplified further when parametric uncertainties are present. What is necessary is a systematic adaptive approach to identification and control of such systems that explicitly accommodates the presence of nonlinear parameters that may not be known precisely. This thesis presents results in both adaptive identification and control of NLP systems. An adaptive controller is presented for NLP systems with a triangular structure. The presence of the triangular structure together with nonlinear parameterization makes standard methods such as back-stepping, and variable structure control inapplicable. A concept of bounding functions is combined with min-max adaptation strategies and recursive error formulation to result in a globally stabilizing controller.
(cont.) A large class of nonlinear systems including cascaded LNL (linear-nonlinear-linear) systems are shown to be controllable using this approach. In the context of parameter identification, results are derived for two classes of NLP systems. The first concerns systems with convex/concave parameterization, where min-max algorithms are essential for global stability. Stronger conditions of persistent excitation are shown to be necessary to overcome the presence of multiple equilibrium points which are introduced due to the stabilization aspects of the min-max algorithms. These conditions imply that the min-max estimator must periodically employ the local gradient information in order to guarantee parameter convergence. The second class of NLP systems considered in this concerns monotonically parameterized systems, of which neural networks are a specific example. It is shown that a simple algorithm based on local gradient information suffices for parameter identification. Conditions on the external input under which the parameter estimates converge to the desired set starting from arbitrary values are derived. The proof makes direct use of the monotonicity in the parameters, which in turn allows local gradients to be self-similar and therefore introduces a desirable invariance property. By suitably exploiting this invariance property and defining a sequence of distance metrics, global convergence is proved. Such a proof of global convergence is in contrast to most other existing results in the area of nonlinear parameterization, in general, and neural networks in particular.
by Aleksandar M. KojiÄ.
Ph.D.
Sakr, Mouhammad [Verfasser]. « Parameterized verification and repair of concurrent systems / Mouhammad Sakr ». Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2021. http://d-nb.info/1236571320/34.
Texte intégralBaur, Ulrike, Christopher Beattie, Peter Benner et Serkan Gugercin. « Interpolatory Projection Methods for Parameterized Model Reduction ». Universitätsbibliothek Chemnitz, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-201000011.
Texte intégralSaksena, Mayank. « Verifying Absence of ∞ Loops in Parameterized Protocols ». Doctoral thesis, Uppsala University, Department of Information Technology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8605.
Texte intégralThe complex behavior of computer systems offers many challenges for formal verification. The analysis quickly becomes difficult as the number of participating processes increases.
A parameterized system is a family of systems parameterized on a number n, typically representing the number of participating processes. The uniform verification problem — to check whether a property holds for each instance — is an infinite-state problem. The automated analysis of parameterized and infinite-state systems has been the subject of research over the last 15–20 years. Much of the work has focused on safety properties. Progress in verification of liveness properties has been slow, as it is more difficult in general.
In this thesis, we consider verification of parameterized and infinite-state systems, with an emphasis on liveness, in the verification framework called regular model checking (RMC). In RMC, states are represented as words, sets of states as regular expressions, and the transition relation as a regular relation.
We extend the automata-theoretic approach to RMC. We define a specification logic sufficiently strong to specify systems representable using RMC, and linear temporal logic properties of such systems, and provide an automatic translation from a specification into an analyzable model.
We develop acceleration techniques for RMC which allow more uniform and automatic verification than before, with greater power. Using these techniques, we succeed to verify safety and liveness properties of parameterized protocols from the literature.
We present a novel reachability based verification method for verification of liveness, in a general setting. We implement the method for RMC, with promising results.
Finally, we develop a framework for the verification of dynamic networks based on graph transformation, which generalizes the systems representable in RMC. In this framework we verify the latest version of the DYMO routing protocol, currently being considered for standardization by the IETF.
Deneux, Johann. « Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods ». Doctoral thesis, Uppsala : Acta Universitatis Upsaliensis, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-6891.
Texte intégralBui-Thanh, Tan. « Model-constrained optimization methods for reduction of parameterized large-scale systems ». Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40305.
Texte intégralThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 143-158).
Most model reduction techniques employ a projection framework that utilizes a reduced-space basis. The basis is usually formed as the span of a set of solutions of the large-scale system, which are computed for selected values (samples) of input parameters and forcing inputs. In existing model reduction techniques, choosing where and how many samples to generate has been, in general, an ad-hoc process. A key challenge is therefore how to systematically sample the input space, which is of high dimension for many applications of interest. This thesis proposes and analyzes a model-constrained greedy-based adaptive sampling approach in which the parametric input sampling problem is formulated as an optimization problem that targets an error estimation of reduced model output prediction. The method solves the optimization problem to find a locally-optimal point in parameter space where the error estimator is largest, updates the reduced basis with information at this optimal sample location, forms a new reduced model, and repeats the process. Therefore, we use a systematic, adaptive error metric based on the ability of the reduced-order model to capture the outputs of interest in order to choose the snapshot locations that are locally the worst case scenarios.
(cont.) The state-of-the-art subspace trust-region interior-reflective inexact Newton conjugate-gradient optimization solver is employed to solve the resulting greedy partial differential equation constrained optimization problem, giving a reduction methodology that is efficient for large-scale systems and scales well to high-dimensional input spaces. The model-constrained adaptive sampling approach is applied to a steady thermal fin optimal design problem and to probabilistic analysis of geometric mistuning in turbomachinery. The method leads to reduced models that accurately represent the full large-scale systems over a wide range of parameter values in parametric spaces up to dimension 21.
by Tan Bui-Thanh.
Ph.D.
Haziza, Frédéric. « Few is Just Enough ! : Small Model Theorem for Parameterized Verification and Shape Analysis ». Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-264171.
Texte intégralDIAZ, RUBEN GOMEZ. « A SYSTEM FOR GENERATION OF PARAMETERIZED MODELS FOR VESSELS DESIGN ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=14888@1.
Texte intégralEste trabalho situa-se numa das linhas de pesquisa da PUC-Rio de projeto de unidades flutuantes tais como, navios e plataformas semi-submersíveis. Nesta linha de pesquisa estão sendo desenvolvidos os programas gráficos MG (Mesh Generator) e o Sstab. O primeiro programa é um modelador geométrico por meio de seções transversais e gerador de malhas para modelos de estruturas flutuantes. O segundo programa é utilizado para a análise de estabilidade estática dos modelos gerados pelo MG. Este trabalho propõe um ambiente integrado de modelagem e de análise estática e dinâmica de estruturas flutuantes. O principal diferencial deste ambiente está no fato de possibilitar a geração automática de variantes de um determinado modelo padrão, a fim de atingir uma configuração desejada, seja no aspecto geométrico ou com relação a sua estabilidade estática. Este ambiente faz uso da linguagem Lua e é possível definir variáveis globais para serem utilizadas como parâmetros de modelagem que extraem, ou modificam, dados como comprimento, largura, altura etc. É possível parametrizar um modelo qualquer, em função de variáveis escolhidas pelo usuário, o que possibilita uma modelagem automática, com a variação de alguns destes parâmetros. Foram ainda desenvolvidas algumas ferramentas auxiliares que facilitam a modelagem de uma estrutura flutuante. Estas ferramentas verificam a consistência topológica de uma malha, gerar uma subdivisão gradativa das curvas cortadas e simplificar as novas malhas geradas. É possível também detectar se o modelo possui simetria num determinado plano e realizar, de forma automática, cortes do modelo final para diferentes calados.
This work is related to the PUC-Rio research area of vessel´s designs such as ships and semi-sub platforms. In this research area two softwares have been developed: MG and Sstab. The first is a geometric modeler based on cross sections and also on a mesh generator; the second is a software for the analysis of static and dynamic stability of MG models. This work proposes an integrated environment for modeling, and static and dynamic analysis of vessels. The main advantage of the proposed environment is that it is possible to obtain automatically variants of a specific model in order to achieve a desired configuration, not only in relation to geometry but also concerning the static stability aspect. This environment uses the Lua programming language and it is possible to define global variables to be used as parameters which retrieve or modify modeling values such as length, width, height, and so on. Any model can be parameterized, as a function of user chosen variables, which allows an automatic modeling with the variation of those parameters. There has been also developed some auxiliary tools which help the modeling of floating structures. Those tools verify the topological consistency of a mesh, generate a gradual subdivision of intersected curves and simplify the new generated meshes. They are also able to detect if the model has symmetry in relation to a certain plane, and sections can be automatically obtained according to different draughts.
Röckl, Christine. « On the mechanized validation of infinite-state and parameterized reactive and mobile systems ». [S.l. : s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=962067180.
Texte intégralGöthel, Thomas [Verfasser], et Sabine [Akademischer Betreuer] Glesner. « Mechanical Verification of Parameterized Real-Time Systems / Thomas Göthel. Betreuer : Sabine Glesner ». Berlin : Universitätsbibliothek der Technischen Universität Berlin, 2012. http://d-nb.info/1023762234/34.
Texte intégralRubattu, Claudio. « Response time analysis of parameterized dataflow applications on heterogeneous SW/HW systems ». Thesis, Rennes, INSA, 2020. http://www.theses.fr/2020ISAR0005.
Texte intégralIn contexts such as embedded and cyber-physical systems, the design of a desired functionality under constraints increasingly requires a parallel execution of different tasks on heterogeneous architectures. The nature of such parallel systems implies a huge complexity in understanding and predicting performance in terms of response time. Indeed, response time depends on many factors associated with the characteristics of both the functionality and the target architecture. State-of-the art strategies derive response time by examining the operations required by each task for both processing and accessing shared resources. This procedure is often followed by the addition or elimination of potential interferences due to task concurrency. However, such approaches require an advanced knowledge of the software and hardware details, rarely available in practice. This thesis provides an alternative "topdown" strategy aimed at extending the cases in which hardware and software response times can be analyzed and predicted. The proposed strategy leverages on dataflow-based application representations and focuses on the response time estimation of reconfigurable applications mapped on both general-purpose and specialized processing elements
Arslan, Ali Erkin. « Range Parameterized Bearings-only Tracking Using Particle Filter ». Phd thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614888/index.pdf.
Texte intégralHover, Franz S. « Deeply-towed underwater vehicle systems : a verified analytical procedure for creating parameterized dynamic models ». Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14005.
Texte intégralFrechina, Navarro Francisco. « A Rewriting-based, Parameterized Exploration Scheme for the Dynamic Analysis of Complex Software Systems ». Doctoral thesis, Universitat Politècnica de València, 2014. http://hdl.handle.net/10251/44234.
Texte intégralFrechina Navarro, F. (2014). A Rewriting-based, Parameterized Exploration Scheme for the Dynamic Analysis of Complex Software Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/44234
TESIS
Murali, madhavan rathai Karthik. « Synthesis and real-time implementation of parameterized NMPC schemes for automotive semi-active suspension systems ». Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALT052.
Texte intégralThis thesis discusses the synthesis and real-time (RT) implementation of parameterized Nonlinear Model Predictive Control (pNMPC) schemes for automotive semi-active suspension systems. The pNMPC scheme uses a black-box simulation-based optimization method. The crux of the method is to finitely parameterize the input profile and simulate the system for each parameterized input and obtain the approximate objective and constraint violation value for the pNMPC problem. With the obtained results from the simulation, the input with minimum objective value or the least constraint violation value is selected and injected into the system and this is repeated in a receding horizon fashion. The method was experimentally validated on dSPACE MicroAutoBoX II (MABXII) and the results display good performance of the proposed approach. The pNMPC method was also augmented to parallelized pNMPC and the proposed method was implemented for control of semi-active suspension system for a half car vehicle. This method was implemented by virtue of Graphic Processing Units (GPUs) which serves as a paragon platform for implementation of parallel algorithms through its multi-core processors. Also, a stochastic version of the parallelized pNMPC method is proposed which is termed as Scenario-Stochastic pNMPC (SS-pNMPC) scheme and the method was implemented and tested on several NVIDIA embedded boards to verify and validate the RT feasibility of the proposed method for control of semi-active suspension system for a half car vehicle. In general, the parallelized pNMPC schemes provide good performance and also, fares well for large input parameterization space. Finally, the thesis proposes a software tool termed “pNMPC – A code generation software tool for implementation of derivative free pNMPC scheme for embedded control systems”. The code generation software (S/W) tool was programmed in C/C++ and also, provides interface to MATLAB/Simulink. The S/W tested for variety of examples both in simulation as well as on RT embedded hardware (MABXII) and the results looks promising and viable for RT implementation for real world applications. The code generation S/W tool also includes GPU code generation feature for parallel implementation. To conclude, the thesis was conducted under the purview of the EMPHYSIS project and the goals of the project align with this thesis and the proposed pNMPC methods are amenable with eFMI standard
Lacirignola, Martino. « Life cycle assessment of enhanced geothermal systems : from specific case studies to generic parameterized models ». Thesis, Paris, CNAM, 2017. http://www.theses.fr/2017CNAM1095/document.
Texte intégralThis thesis investigates the environmental impacts of an emerging renewable energy technology, the enhanced geothermal systems (EGS), using a life cycle assessment (LCA) approach.Following the analysis of several EGS case studies, we developed a parameterized LCA model able to provide a global overview of the life cycle impacts of the EGS technology. The greenhouse gas emissions of EGS are found comparable with other renewable energy systems and far better than those of power plants based on fossil fuels.In a second stage, we developed a methodological framework for the application of global sensitivity analysis (GSA) to the LCA of emerging technologies like the EGS, taking into account the high uncertainties related to their description. We applied our new GSA approach to generate a simplified LCA model, aimed at decision makers, allowing a rapid estimation of the life cycle impacts of EGS from only five key parameters: installed capacity, drilling depth, number of wells, flow rate and lifetime.The methodological approach developed in this thesis is applicable to other technologies and opens large research perspectives in the field of environmental assessment
Andung, Muntaha Muhamad. « Non-intrusive Logging and Monitoring System of a Parameterized Hardware-in-the-loop Real-Time Simulator ». Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254655.
Texte intégralElektronisk styrenhet (ECU) är en viktig del i dagens fordon. I ett komplett fordon finns det många ECU installerade. Var och en av dessa kontrollerar en enda funktion hos fordonet. Under en utvecklingscykel för en ecu måste dess funktionalitet valideras mot kravspecifikationen. HIL-metoden (Hardware-in-the-loop) används vanligtvis för att göra detta genom att testa ECU i en virtuell representation av sitt styrda system. En viktig del av HIL-testmetoden är en mellanliggande komponent som fungerar som en bro mellan simuleringsdatorn och den ecu som testas. Denna komponent driver ett parametrerat realtidssystem som översätter meddelanden från simuleringsdatorn till ECU som testas och vice versa. Det har en strikt realtidskrav för att alla uppgifter ska kunna slutföras.Ett loggnings och övervakningssystem behövs för att den mellanliggande komponenten ska fungera korrekt. Denna funktionalitet är implementerad i form av extraordinära uppgifter med låg prioritet som körs samtidigt med de högsta prioritetsuppgifterna för översättningstjänster. Genomförandet av dessa uppgifter, tillsammans med ett distribuerat system för att stödja loggnings och övervakningsfunktionaliteten, presenteras i detta avhandlingararbete.Flera utförandetidsmätningar utförs för att få information om hur parametrarna för en uppgift påverkar dess körtid. Därefter används den linjära regressionsanalysen för att modellera exekveringstidestimeringen av de parametrerade uppgifterna. Slutligen används tidsanalysanalysen för att garantera att systemet är schemaläggbart.
Stavrakakis, Kynthia Katherina [Verfasser], Thomas [Akademischer Betreuer] Weiland et Romanus [Akademischer Betreuer] Dyczij-Edlinger. « Model Order Reduction Methods for Parameterized Systems in Electromagnetic Field Simulations / Kynthia Katherina Stavrakakis. Betreuer : Thomas Weiland ; Romanus Dyczij-Edlinger ». Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2012. http://d-nb.info/110611650X/34.
Texte intégralFarough, Aida. « A Parameterized Approach to Partitioning Between Focused and Diffuse Heat Output and Modeling Hydrothermal Recharge at The East Pacific Rise 9°50´N ». Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/78062.
Texte intégralMaster of Science
Kaiser, Alexander. « Monotonicity in shared-memory program verification ». Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:1d16b4b5-524a-40db-b7bf-062374f8679c.
Texte intégralKorneva, Alexandrina. « The Cubicle Fuzzy Loop : A Testing Framework for Cubicle ». Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG095.
Texte intégralThe goal of this thesis is to integrate a testing technique into the Cubicle model checker. To do this, we extended Cubicle with a Fuzzing loop (called the Cubicle Fuzzy Loop - CFL). This new feature serves two primary purposes.Firstly, it acts as an oracle for Cubicle's invariant generation algorithm. The existing algorithm, which is based on a forward exploration of reachable states, was significantly limited by its heuristics when applied to highly concurrent models. CFL introduces amore efficient way to explore these models, visiting a larger number of relevant states.Its second objective is to quickly and efficiently detect issues and vulnerabilities in models of all sizes, as well as detect deadlocks.The integration of CFL has also enabled us to enhance the expressiveness of Cubicle's input language, including new primitives for manipulating threads (locks, semaphores, etc.).Lastly, we built a testing framework around Cubicle and CFL with an interactive interpreter, which is useful for debugging, prototyping, and step-by-step execution of models. This new system has been successfully applied in a case study of a distributed consensus algorithm for blockchains
Mebsout, Alain. « Inférence d'invariants pour le model checking de systèmes paramétrés ». Thesis, Paris 11, 2014. http://www.theses.fr/2014PA112188/document.
Texte intégralThis thesis tackles the problem of automatically verifying complexparameterized systems. This approach is important because it can guarantee thatsome properties hold without knowing a priori the number of components in thesystem. We focus in particular on the safety of such systems and we handle theparameterized aspect with symbolic methods. This work is set in the theoreticalframework of the model checking modulo theories and resulted in a new modelchecker: Cubicle.One of the main contribution of this thesis is a novel technique forautomatically inferring invariants. The process of invariant generation isintegrated with the model checking algorithm and allows the verification inpractice of systems which are out of reach for traditional symbolicapproaches. One successful application of this algorithm is the safety analysisof industrial size parameterized cache coherence protocols.Finally, to address the problem of trusting the answer given by the modelchecker, we present two techniques for certifying our tool Cubicle based on theframework Why3. The first consists in producing certificates whose validity canbe assessed independently while the second is an approach by deductiveverification of the heart of Cubicle
Pham, Thi Ngoc Diem. « Spécification et conception de services d'analyse de l'utilisation d'un environnement informatique pour l’apprentissage humain ». Thesis, Le Mans, 2011. http://www.theses.fr/2011LEMA1015/document.
Texte intégralThe research topic of this thesis is a part of the REDIM (model driven re-engineering) research project. It focuses specifically on the analysis of tracks collected during the learning session by a TEL (Technology Enhanced Learning) system in order to provide teachers indicators calculated. In our work environment, UTL (Usage Tracking Language) allows users to define the indicators in a form close to the design patterns. It was designed to response capitalization and reuse questions. However, UTL did not initially have any means to formally specify how to calculate indicators based on tracks collected. In general, design patterns are limited to the description, they cannot be automated. In addition, textual descriptions in UTL to produce indicators from tracks do not allow generating automatically an indicator’s values.Our main research objective was therefore to define models, methods and tools for formalizing and automating the calculation of indicators. We propose an extension for UTL named DCL4UTL (Data Combination Language for UTL) to model indicators in a capitalizable, automatable and reusable form to provide meaningful indicators to teachers/designers. With this new version, the indicators can be calculated in real-time or after a learning session in the context of tutoring actions or the reengineering of learning scenarios, respectively.The originality of our approach (DCL4UTL) lies in the fact that this version not only capitalize know-how on analysis techniques of the use an TEL system, but also (1) formally describe models and calculation methods of indicators from tracks collected by a TEL system, (2) integrate external functions (from other analysis tools), and (3) create parameterized intermediate data facilitating the modeling and reuse of indicators’ calculation method. We have also developed an analysis tool to calculate modeled indicators. Our approach and language have been validated by several experiments with several existent TEL systems
PIRES, Stéfani Silva. « Descoberta de causa-raiz em ocorrências de sistemas elétricos ». Universidade Federal de Campina Grande, 2010. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1471.
Texte intégralMade available in DSpace on 2018-08-16T13:58:48Z (GMT). No. of bitstreams: 1 STEFANI SILVA PIRES - DISSERTAÇÃO PGCC 2010..pdf: 819684 bytes, checksum: 625f468cb174d699bf5b98131d1adf61 (MD5) Previous issue date: 2010-08-19
Este trabalho apresenta uma técnica de análise de causa-raiz para sistemas elétricos de potência. A análise de causa-raiz é uma forma de auxiliar o operador na compreensão da ocorrênciadefalha,interpretandoasocorrênciascomefeito"cascata"entreoselementosda rede. A técnica proposta utiliza o raciocínio baseado em regras, onde regras parametrizadas constroem um modelo de propagação com os diagnósticos de uma ocorrência de falha. A técnica permite apontar o elemento causador da ocorrência, e detalhar a sua propagação para os demais elementos em um modelo de causa-efeito. A utilização de regras parametrizadas traz grandes vantagens ao processo, permitindo que a técnica seja adaptável a alterações na topologia do sistema, e contribuindo para sua escalabilidade. Um estudo de caso foi elaborado para sua avaliação, no contexto da Companhia Hidro Elétrica do São Francisco (CHESF), onde foi desenvolvido um protótipo que implementa a técnica, e levantados um conjunto de regras parametrizadas e um conjunto de cenários de falha utilizando uma ferramenta de simulação de um ambiente real, o Simulop. Utilizamos também na avaliação, um conjunto de regressões, que são dados históricos armazenados pela CHESF. As regressões foramimportantesnaprimeirafasededefiniçãodatécnica,masapresentamproblemascomo afaltadedados,ecomportamentosinesperadosdosistema,ondeamargemdeacertodatécnica foi de 74%. Para o conjunto de cenários levantados com oSimulop, a técnica proposta conseguiu realizar com sucesso o processo de análise de causa-raiz, identificando a causaraiz da ocorrência em 100% dos cenários de falha, e detalhando sua propagação para todos os outros elementos da rede envolvidos em 89% dos cenários, onde a margem de erro é composta de cenários cuja propagação foi identificada apenas parcialmente, devido à falta de regras que contemplassem os cenários. Dessa forma, a técnica proposta se mostrou uma abordagem viável para a análise de causa-raiz em sistemas elétricos. A margem de acerto reduzida nas regressões, indica que, para ser aplicada em um ambiente operacional real, faz-se necessária a elaboração de um conjunto de regras mais abrangente e que possa contornar esses problemas.
This paper presents a root cause analysis technique for electric power systems. The root cause analysis is a way to assist the operator in understanding the occurrence of failure, interpreting the events cascade occurrences. The proposed technique uses a rule based reasoning, where parameterized rules construct a propagation model with diagnosis of an occurrence of failure. The technique allows to point out the element that causes the occurrence, and detailing its propagation to other elements in a cause and effect model. The use of parameterized rules brings major benefits to the process, allowing the technique to be adaptable to changes in system topology, and contributing to its scalability A case study was prepared for evaluation in the context of the Companhia Hidro Elétrica do São Francisco (CHESF). We developed a prototype that implements the technique, and raised a set of parameterized rules and a set of failure scenarios using a tool to simulate a real environment, the Simulop. We also used in the evaluation process, a set of regressions, which are historical data stored by CHESF. The regressions were important in the first phase of the technique, but they have problems such as lack of data, and unexpected behavior of the system, where the accuracy of the technique was 74%. For the set of scenarios created with Simulop, the proposed technique has achieved success in the root cause analysis process, identifying the root cause of the occurrence in 100% of failure scenarios, and detailing their propagation to all other equipments involved in 89% of scenarios, where the margin of error is composed of scenarios whose propagation has been identified only in part due to the lack of rules that contemplate these scenarios. Thus, the proposed technique proved to be a viable approach to root cause analysis in electrical systems. The reduced margin of success in the regressions , indicates that, to be applied to an operational environment, it is necessary to elaborate a comprehensive set of rules that can deal these problems.
TSAO, YA-LAN, et 曹亞嵐. « Parameterized DSP Core for Communication System ». Thesis, 2005. http://ndltd.ncl.edu.tw/handle/67315834973933899323.
Texte intégral國立中央大學
電機工程研究所
93
This thesis is a comprehensive work of a parameterized DSP core for embedded system. The overall research includes the parameterized architecture of the DSP core, multi-function data-path, input/output modes for embedded applications, low-power techniques, optional special function blocks and module generator. Parameterized DSP core is designed for optimal usage of different requirements in system applications. Owing to the parameterized structure, the DSP core can be custom made for dedicated system with parameters setting. The parameterized DSP core is especially suitable for an embedded system. The primary application is digital signal processing system which designed to achieve demodulation/synchronization with better performance and flexibility. We set up a novel design flow of embedded parameterized DSP core. The design flow includes a newly designed flexible parameterized DSP core structure, a module generator and a methodology to build the DSP core with optimal performance. The features in this DSP core include parameterized data-path, dual MAC unit, sub-word MAC and optional function-specific blocks for accelerating communication system modulation operations. This DSP core also has a low power structure, which includes the gray code addressing mode, pipeline sharing and a novel buffered hardware looping. Users can select the parameters and special function blocks based on the specification of their applications and then a synthesizable DSP core is generated in a proposed module generator with graph user interface. The proposed DSP core and the synthesizable RTL code have been verified with TSMC 0.35um SPQM, 0.25um 1P5M cell based and FPGA design flow.
Teng, Jun-Xian, et 鄧君賢. « Parameterized and Embedded DSP Datapath for Communication Systems ». Thesis, 2002. http://ndltd.ncl.edu.tw/handle/08688439715373836824.
Texte intégral國立中央大學
電機工程研究所
90
Abstract In this thesis, a parameterized DSP datapath design and the parameterized DSP design flow are carried out. The proposed parameterized DSP is composed of DSP itself along with special blocks designed for communication systems. We term this kind processor as parameterized ASIC/DSP core. In the DSP datapath design, a subword MAC path with consideration of guard bit allocation is built for application in two different precision situations. Other than the subword MAC path, a correlator designed for WCDMA system is proposed. The correlator is designed to cooperate with DSP and share the same data bus with DSP. A parameterized DSP design flow is also proposed in this thesis, we divide issues during a parameterized DSP develop process into three sorts : arguments, control schemes, and structures. These issues are introduced and solved by establish an parameterized DSP generator, which is designed in Visual Basic and C language.
Stahl, Karsten [Verfasser]. « Exploring the limits of parameterized system verification / Karsten Stahl ». 2003. http://d-nb.info/971627908/34.
Texte intégralRosemblun, Marcela Laura. « Automatic differentiation : Overview and application to systems of parameterized nonlinear equations ». Thesis, 1993. http://hdl.handle.net/1911/13777.
Texte intégralStavrakakis, Kynthia Katherina. « Model Order Reduction Methods for Parameterized Systems in Electromagnetic Field Simulations ». Phd thesis, 2012. https://tuprints.ulb.tu-darmstadt.de/3033/1/ThesisStavrakakisKynthia.pdf.
Texte intégralLiu, Shi Hui. « Simulated validation of real-time reactive system with parameterized events ». Thesis, 2003. http://spectrum.library.concordia.ca/2334/1/MQ83912.pdf.
Texte intégralMiller, Adam Robert. « Development and verification of parameterized digital signal processing macros for microelectronic systems ». 2003. http://etd.utk.edu/2003/MillerAdam.pdf.
Texte intégralTitle from title page screen (viewed Oct. 14, 2003). Thesis advisor: D.W. Bouldin. Document formatted into pages (v, 106 p. : ill. (some col.)). Vita. Includes bibliographical references (p. 49-50).