To see the other types of publications on this topic, follow the link: Automated mode.
Dissertations / Theses on the topic 'Automated mode'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Automated mode.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Hugo, Etienne Martin. "Automated design of multi-mode fuzzy controllers." Thesis, Stellenbosch : Stellenbosch University, 2000. http://hdl.handle.net/10019.1/51631.
Full textAbstract:
Dissertation (PhD)--University of Stellenbosch, 2000.ENGLISH ABSTRACT: A standard fuzzy logic controller is not robust enough to guarantee consistent closed-loop performance for highly non-linear plants. A finely tuned closed-loop response loses relevance as the system dynamics change with operating conditions. The self-adaptive fuzzy logic controller can track changes in the system parameters and modify the controller parameters accordingly. In most cases, self-adaptive fuzzy logic controllers are complex and rely on some form of mathematical plant model. The multi-mode fuzzy logic controller extends the working range of a standard fuzzy logic controller by incorporating knowledge of the non-linear system dynamics into the control rule-base. The complexity of the controller and difficulty in finding control rules have limited the application of multi-mode fuzzy logic controllers. An automated design algorithm is proposed for the design of a multi-mode control rule-base using qualitative plant knowledge. The design algorithm is cost function-based. The closed-loop response, local to a domain of the non-linear state space, can be tuned by manipulation of the cost function weights. Global closed-loop response tuning can be done by manipulation of the controller input gains. Alternatively, a self-learning or self-adaptive algorithm can be used in a model reference adaptive control architecture to optimise the control rule-base. Control rules responsible for unacceptable closed-loop performance are identified and their consequences modified. The validity of the proposed design method is evaluated in five case studies. The case studies illustrate the advantages of the multi-mode fuzzy logic controller. The results indicate that the proposed self-adaptive algorithm can be used to optimise a rule-base given a required closed-loop specification. If the system does not conform to the model reference adaptive architecture then the intuitive nature of the cost function based design algorithm proves to be an effective method for rule-base tuning.
AFRIKAANSE OPSOMMING: Standaard wasige logika beheerders is nie noodwendig robuust genoeg om goeie geslote lus werkverrigting vir hoogs nie-liniere aanlegte te waarborg nie. In Perfek ge-optimeerde beheerder se geslote lus werkverrigting mag verswak indien die aanleg-parameters weens bedryfstoestande verander. Self-aanpassende beheerders kan die verandering in die aanleg-parameters volg en die beheerder dienooreenkomstig optimeer. As In reël is In self-aanpassende beheerder kompleks en afhanklik van In wiskundige model van die aanleg. Die multi-modus wasige logika beheerder vergroot die werksbereik van die standaard wasige logika beheerder deur kennis aangaande die stelsel se bedryfstoestand en stelselparameters in die reël-basis in te bou. Die aanwending van die multi-modus beheerder word tans beperk deur die struktuur kompleksiteit en moeilike optimering van die reël-basis. In Ge-outomatiseerde multi-modus reël-basis ontwerps-algoritme wat gebruik maak van kwalitatiewe kennis van die aanleg en In kostefunksie word in hierdie proefskrif voorgestel. Die geslote lus gedrag beperk tot In gebied in die toestands-ruimte kan ge-optimeer word deur die kostefunksie gewigte te manipuleer. Die globale werkverrigting kan ge-optimeer word met die beheerder intree aanwinste. In Self-aanpassende algoritme in In model-verwysings aanpassende argitektuur word as altematieftot reël-basis optimering voorgestel. Reëls verantwoordelik vir swak werkverrigting word ge-identifiseer en verbeter deur modifikasie van die reëls se gevolgtrekkings. Die voorgestelde ontwerps-metode word deur middel van vyf gevallestudies ondersoek. Die studies dui die voordele van die multi-modus struktuur aan. Die self-aanpassende argitektuur is In kragtige hulpbron om In reël-basis te optimeer vir In gegewe geslote lus spesifikasie. Hierdie proefskrif toon aan dat indien die stelsel nie aan die vereistes van In model verwysingstelsel voldoen nie, is die kostefunksie benadering tot reël-basis ontwerp In aantreklike en intuïtief verstaanbare opsie om die reël-basis te optimeer.
2
Florin, Charles Henri. "Automated Traffic Control for Smart Landing Facilities." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/36095.
Full textAbstract:
The Small Aircraft Transportation System (SATS) is a partnership between the FAA, the NASA, US aviation companies, universities and state and local aviation officials. The purpose of SATS is to develop a system to handle future increase in Air Traffic, reduce time-travel, develop automation in
Air Traffic Control (ATC) and make better use of small aircraft and underused airports. The Smart Landing Facility (SLF) is an important part of
the program. The SLF is a small airport upgraded with equipment to support SATS aircraft. Among the SLF equipment, SATS needs new detection equipment, and eventually automation.
This thesis investigates different techniques to avoid data collision in aircraft radar responses, and to reduce delays between landings and take offs. First, the paper shows how and when the radar receiver can separate two overlapped radar responses. Second, to avoid transponders responses overlapping, requirements in terms of aircraft safety distance are computed, different conflicts in air traffic around the SLF are examined and a
solution is proposed for each case. And finally, the thesis investigates how far SATS can go in developing an automatic ATC system and what the role of future human operator will be in ATC.Master of Science
3
Morton, Mark A. "Traction Control Study for a Scaled Automated Robotic Car." Thesis, Virginia Tech, 2004. http://hdl.handle.net/10919/9946.
Full textAbstract:
This thesis presents the use of sliding mode control applied to a 1/10th scale robotic car to operate at a desired slip. Controlling the robot car at any desired slip has a direct relation to the amount of force that is applied to the driving wheels based on road surface conditions. For this model, the desired traction/slip is maintained for a specific surface which happens to be a Lego treadmill platform. How the platform evolved and the robot car was designed are also covered.
To parameterize the system dynamics, simulated annealing is used to find the minimal error between mathematical simulations and physical test results. Also discussed is how the robot car and microprocessor can be modeled as a hybrid system. The results from testing the robot car at various desired percent slip show that it is possible to control the slip dynamics of a 1/10th scale automated robotic car and thus pave the way for further studies using scaled model cars to test an automated highway system.Master of Science
4
Matenda, Mutondo Paul. "Development of an energy model in system modeling language for future automated residential building applications." Thesis, Cape Peninsula University of Technology, 2014. http://hdl.handle.net/20.500.11838/1190.
Full textAbstract:
Thesis (MTech(Electrical Engineering)) -- Cape Peninsula University of Technology, 2014Today the building energy modeling industry is facing a number of challenges, the advanced programs or methods developed for building energy modeling, are very technical and complex to be used, especially for earlier designs, and the easy programs or methods are not accurate. Moreover, more than a hundred programs developed for energy modeling, have been used in the same building, but most of the time the results differed by about 30%. That is why this thesis has developed a new building energy model in System Modeling Language (SysML), in order to meet, at the same time, the accuracy and the simplicity to be used for future and existing buildings. In this thesis, SysML has been used to develop an energy model and to set up an automation system to the existing building. SysML can do more than simulations, but this thesis is limited to only the simulations steps by using easy applications of SysML and fewer diagrams which could develop in a complete building energy model. SysML is the extension of Unified modeling Language (UML), which uses fewer diagrams than UML. SysML is simple, open and more flexible to be used in any Engineering System. The previous chapter describes SysML and gives the overview and the platform of SysML. The simulations of SysML in this project have been developed through Enterprise Architect and Mat lab software. The inputs used to simulate the program are the parameters of the existing building chosen for modeling that is a student residential building complex located in Stellenbosch, Western Cape in South Africa. Automation system program used in this thesis was based on the norms and building standards of South Africa, renewable energy and the requirements of the buildings’ occupants, in order to meet energy efficiency and safety of the occupants.
5
Beargie, Aimee M. "Sliding mode control of a non-collocated flexible system." Thesis, Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/19306.
Full text
6
Hamed, Hamad Shejoon. "Module based on wavelet-transform for electromyography signals processing." Thesis, Boston, USA, 2020. http://openarchive.nure.ua/handle/document/11841.
Full textAbstract:
In developed software optimal EMG resolution component (sub-signal) was selected, and then the reconstruction of the useful information signal was done. Noise and unwanted EMG parts were eliminated throughout this process. Developed module consists of 5 main units for EMG processing based on wavelet-transform. The obtained results allow in the automated mode of developed module execute processing and analysis EMG signals for classification data.
7
Gevaert, Dorine. "Methodology for generic architecture definition for current mode converters including automated building block characterisation and mismatch modelling." Thesis, Leeds Beckett University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.485478.
Full textAbstract:
The challenges for the next generation of integrated circuit (IC) design of analogue and mixed-signal building blocks in standard CMOS technologies for moderate signal conversion in broadband applications, demand research progr~ss in the emerging scientific fields of device physics and modelling, converter architectures, correction algorithms, design automation, technology development, quality assurance and cost factor analysis. The contribution of this thesis to converter architectures is in new topological reusable bUilding blocks for analogue-to-digital (ADC) current converters and improved switching techniques for digital-to-ana.'tlgue (DAC) current converters. A generic compiler for the current folding and interpolating ADC and current steering DAC converter architectures, which take into account the fast technological CMOS changes in an automated down-link towards the basic building blocks, reduces the design time considerably. The new current converter architectures have been realized for 12-bit accuracy in standard CMOS technology. The generic compiler allows fast architectural exploration for other converter specification and the impact on the sizing of the transistors at basic building blocks level for a certain quality specification to be determined. The contributions to modelling, quality assurance and cost factor are the total new concepts in deriving design curves to reduce the design time and to reduce the total chip area of the current converters. For each new technology design curves for standardized transistor sizes for noise level, threshold voltage, I-V curves, overdrive voltage versus lambda and mismatch error modeling of the standard deviation of the drain current for the target operation condition, are automatically derived. For other transistor sizes the values are calculated in an automated procedure. These new design concepts reduce the over-sizing of the transistors, compared to the existing methods, with 15 to 20% for the same quality specification. Besides the reduction of the silicon cost also the design time cost is reduced considerably.
8
Deshpande, Sagar Shriram. "Semi-automated Methods to Create a Hydro-flattened DEM using Single Photon and Linear Mode LiDAR Points." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1491300120665946.
Full text
9
Wilde, Fabian [Verfasser], and J. [Akademischer Betreuer] Jelonnek. "Automated Mode Recovery and Electronic Stability Control for Wendelstein 7-X Gyrotrons / Fabian Wilde ; Betreuer: J. Jelonnek." Karlsruhe : KIT-Bibliothek, 2021. http://nbn-resolving.de/urn:nbn:de:101:1-2021092904592754898022.
Full text
10
Shah, Urvi. "Development of MEMS power inductors with submicron laminations using an automated electroplating system." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19715.
Full textAbstract:
Thesis (M. S.)--Electrical and Computer Engineering, Georgia Institute of Technology, 2008.Committee Chair: Allen, Mark G.; Committee Member: Divan, Deepakraj M.; Committee Member: Taylor, David G.
11
Stockwell, Kathryn S. "Automatic phased mission system reliability model generation." Thesis, Loughborough University, 2013. https://dspace.lboro.ac.uk/2134/13583.
Full textAbstract:
There are many methods for modelling the reliability of systems based on component failure data. This task becomes more complex as systems increase in size, or undertake missions that comprise multiple discrete modes of operation, or phases. Existing techniques require certain levels of expertise in the model generation and calculation processes, meaning that risk and reliability assessments of systems can often be expensive and time-consuming. This is exacerbated as system complexity increases. This thesis presents a novel method which generates reliability models for phasedmission systems, based on Petri nets, from simple input files. The process has been automated with a piece of software designed for engineers with little or no experience in the field of risk and reliability. The software can generate models for both repairable and non-repairable systems, allowing redundant components and maintenance cycles to be included in the model. Further, the software includes a simulator for the generated models. This allows a user with simple input files to perform automatic model generation and simulation with a single piece of software, yielding detailed failure data on components, phases, missions and the overall system. A system can also be simulated across multiple consecutive missions. To assess performance, the software is compared with an analytical approach and found to match within 5% in both the repairable and non-repairable cases. The software documented in this thesis could serve as an aid to engineers designing new systems to validate the reliability of the system. This would not require specialist consultants or additional software, ensuring that the analysis provides results in a timely and cost-effective manner.
12
De, Sanctis Silvia [Verfasser], and Hans Robert [Akademischer Betreuer] Kalbitzer. "Application of Singular Spectrum Analysis (SSA), Independent Component Analysis (ICA) and Empirical Mode Decomposition (EMD) for automated solvent suppression and automated baseline and phase correction from multi-dimensional NMR spectra / Silvia De Sanctis. Betreuer: Hans Robert Kalbitzer." Regensburg : Universitätsbibliothek Regensburg, 2011. http://d-nb.info/1030178941/34.
Full text
13
Komati, Bilal. "Automated microassembly using an active microgripper with sensorized end-effectors and hybrid force / position control." Thesis, Besançon, 2014. http://www.theses.fr/2014BESA2066/document.
Full textAbstract:
La thèse propose l’utilisation d’une pince active instrumentée en force pour automatiser l’assemblage des MOEMS 3D hybrides. Chacun des doigts de la pince instrumentée est composé d’un actionneur piézo-électrique et d’un capteur de force piézorésistif intégré. Le capteur de force intégré présente des performances innovantes par rapport aux capteurs existants dans l’ état de l’art. Cette pince offre la possibilité de mesurer les forces de serrage appliquées par la pince pour saisir un micro composant et d’estimer les forces de contact entre le micro composant et le substrat de micro-assemblage.Un modèle dynamique et non linéaire est développé pour la pince instrumentée. Une commande hybride force/position est utilisée pour automatiser le micro-assemblage. Dans cette commande, certains axes sont commandés en position et les autres sont commandés en force. Pour les axes commandés en force, une nouvelle commande fondée sur une commande en impédance avec suivi de référence est proposée selon un principe de commande non linéaire par mode glissant avec estimation des paramétres en lignes. En utilisant le schéma de commande hybride force/position proposé, une automatisation de toutes les tâches de micro-assemblage est réalisée avec succès, notamment sur un composant flexible à guider dans un railThis work proposes the use of an active microgripper with sensorized end-effectors for the automationof the microassembly of 3D hybrid MOEMS. Each of the two fingers of the microgripper is composedof a piezoelectric actuator with an integrated piezoresistive force sensor. The integrated force sensorpresents innovative performances compared to the existing force sensors in literature. The forcesensors provide the ability to measure the gripping forces applied by the microgripper to grasp a microcomponentand estimated the contact forces between the microcomponent and the substrate ofmicroassembly. A dynamic nonlinear model of the microgripper is developed. A hybrid force/positioncontrol is used for the automation of the microassembly. In the hybrid force/position control formulation,some axes are controlled in position and others are controlled in force. For the force controlledaxes, a new nonlinear force control scheme based on force tracking sliding mode impedance controlis proposed with parameter estimation. Using the proposed hybrid force/position control scheme, fullautomation of the microassembly is performed, notably for the guiding of a flexible component in arail
14
Olender, Bogdan, and Богдан Андрійович Олендер. "Computer traction management system in the mode of landing on a short runway." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/50741.
Full textAbstract:
1. Rogozhin V.A., Sineglazov V.M., Filyashkin N.. Automated aircraft control systems: K .: NAU, 2003. - 502 p.
2. Inozemtsev A. A., Konyaev E. A., Medvedev V. V. and et al. Aircraft engine PS-90A M .: FIZMATLIT, 2007 .- 320 p.Analysis of European airfields in small towns shows that today airfields with "short runways" are the largest group, and in the future their number will only increase due to: the desire to bring airfields to densely populated areas, as well as due to low , compared with the "elite" airfields, construction costs. This trend is accompanied by the emergence of short take-off and landing aircraft SR, as well as the implementation of automated control systems (ACS) and such aircraft modern methods of landing control on "short runways". Based on the analysis of the experience of developing such ACS, the following requirements for onboard short-landing systems can be determined: information support of the approach to landing on a steep glide path with a landing point located at the beginning of the runway, while implementing high-precision guidance to the point of contact; direct control of the thrust of the power plant, with the optimal combination of the action of the chassis brakes and reverse thrust at the stage of the run of the aircraft on the runway.
Аналіз європейських аеродромів у малих містах показує, що сьогодні аеродроми з «короткими злітно-посадковими смугами» є найбільшою групою, і в майбутньому їх кількість буде лише збільшуватися через: бажання довести аеродроми до густонаселених районів, а також через низькі, порівняно з "елітними" аеродромами, витрати на будівництво. Ця тенденція супроводжується появою літаків короткого зльоту і посадки SR, а також впровадженням автоматизованих систем управління (САУ) і таких літаків сучасними методами керування посадкою на "коротких злітно-посадкових смугах". На основі аналізу досвіду розробки такої САУ можна визначити наступні вимоги до бортових систем короткої посадки: інформаційне забезпечення підходу до посадки на крутому ковзаючому шляху з точкою посадки, розташованою на початку злітно-посадкової смуги, тоді як здійснення високоточного наведення до точки контакту; безпосереднє керування тягою силової установки, з оптимальним поєднанням дії гальм шасі і зворотної тяги на етапі запуску літака на злітно-посадкову смугу.
15
Thiruppalli, Shridharan. "Incremental generation of alternative process plans for integrated manufacturing." Ohio University / OhioLINK, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1175008853.
Full text
16
Bibbings, Kate. "The utility of b-mode ultrasound for the diagnosis of motor neurone disease : automated detection and analysis of muscle twitches in ultrasound images of motor neurone disease affected participants and healthy controls." Thesis, Manchester Metropolitan University, 2017. http://e-space.mmu.ac.uk/619950/.
Full textAbstract:
Motor Neurone Disease (MND) is a progressive, neurodegenerative disease, for which there is no known cure. Electromyography (EMG) is the standard technique for the detection of diagnostic indicators, such as fasciculations (twitches). Ultrasound (US) imaging may provide a more sensitive alternative to EMG for detection of fasciculations. However, only one computational technique has previously been applied to image sequences to provide an objective measure of fasciculation occurrence. The work presented here therefore describes the development and evaluation of a new computational approach, based on foreground detection using a mixture of Gaussians (GMM). In addition, the only other computational analysis approach available, which is based on feature tracking and mutual information analysis (KLT/MI) was further evaluated. Two data sets were used to evaluate the computational approaches. The first data set had previously been collected and comprised US images from medial gastrocnemius (MG) and biceps brachii (BB) from healthy (n = 20) and MND affected (n = 5) participants. The second data set comprised simultaneously recorded US images and intramuscular EMG from five muscles (medial gastrocnemius (MG), biceps brachii (BB), rectus femoris (RF), trapezius (TRAP), rectus abdominis (RA) and thoracic paraspinal (TP)) of healthy (n = 20) and MND affected (n = 20) participants. Accuracy of the approaches for fasciculation detection was evaluated against two measures of ground-truth: i) manual identification; ii) intramuscular EMG. Accuracy was defined as the area under the receiver operator curve and comparisons made between the performance of GMM and KLT/MI. Initial analysis was completed on the large limb muscles, MG and BB. The GMM had better accuracy than the KLT/MI when compared against operator identifications as the ground truth signal (88 – 94 % vs. 82 – 90 %). When EMG was used as the ground truth the GMM again had higher accuracy (81 – 88 % vs. 70 – 79 This thesis has shown a GMM computational analysis can detect fasciculations across a wide range of muscles and also can be used for the characterisation of fasciculations as they appear in ultrasound images, with significant differences being found between the healthy and MND affected participant groups. It has provided a foundation from which to build, with suggestions for future work being collecting images of stimulated twitches in a wide range of muscles for further characterisation and also a larger scale study prior to an official diagnosis being made to determine sensitivity and specificity values for this method as a diagnostic test.
17
Ricca, Steven. "Using a one-chip microcomputer to control an automated warehouse model." Ohio : Ohio University, 1988. http://www.ohiolink.edu/etd/view.cgi?ohiou1182869918.
Full text
18
Gutierrez, Lopez Armando, and Viela Ignacio Manuel Mulas. "Automated Telecommunication Software Testing : An automated model generator for Model-Based Testing." Thesis, KTH, Kommunikationssystem, CoS, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93852.
Full textAbstract:
In Model-Based Testing (MBT) the main goal is to test a system by designing models which describe the functionality of the system to test. Subsequently, test cases are obtained from the model, and these test cases can be executed automatically. Experience has shown that the learning curve for learning MBT can be steep - especially for people who do not have previous programming experience. This is because the language used to design models uses programming language concepts. In this thesis we describe a tool which automatically generates models, given an initial set of requirements. The advantage of this tool is that users do not need to learn a model-based testing language to design models, but instead they must learn to use a high-level of abstraction and a Graphical User Interface to specify their test cases. We demonstrate the value of the tool by using it to design models that generate test cases for telecommunications system, but show that this tool can be adapted for use in testing similar systems. The application of this tool can facilitate traditional phase-based software development methods, by saving a considerable amount of time and resources. In addition, when applied to agile software development, the reduced time required for testing because of the use of our tool helps shortening the feedback loops between designing and testing, thus increasing team efficiency within every iteration.I Model-Based Testing (MBT) är det huvudsakliga målet att testa ett system genom modeller som beskriver systemets unktionalitet för att testa. Därefter erhålls testfall från modellen, och dessa testfall kan utföras automatiskt. Erfarenheten har visat att inlärningskurvan för lärande MBT kan vara branta - särskilt för personer som inte har tidigare erfarenhet av programmering. Detta beror på det språk som används för användning programmeringsspråk begrepp. I denna avhandling beskriver vi ett verktyg som automatiskt genererar modellerna, med tanke på en första uppsättning krav. Fördelen med detta verktyg är att användarna inte behöver lära sig en modellbaserad testning av språket att konstruera modeller, utan de måste lära sig att använda en hög nivåav abstraktion och ett grafiskt användargränssnitt för att ange sina testfall. Vi demonstrerar värdet av verktyget genom att använda den för att konstruera modeller som genererar testfall för telekommunikationssystem, men visar att detta verktyg kan anpassas för användning vid testning av liknande system. Tillämpningen av detta verktyg kan underlätta traditionella fas-baserade metoder mjukvaruutveckling, genom att spara en avsevärd tid och resurser. Dessutom, när det tillämpas på Agile Software utveckling, minskade tid som krävs för att testa på grund av användningen av vårt verktyg hjälper förkorta återkopplingar mellan design och testning, vilket ökar teamet effektiviteten inom varje iteration.
En Model-Based Testing (MBT), el objetivo principal es testear un sistema mediante el diseño de modelos que describan su funcionalidad. En consecuencia, estos modelos generan test cases que pueden ser ejecutados automáticamente en dicho sistema. La experiencia nos muestra que la curva de aprendizaje en el caso de MBT puede ser pronunciada, especialmente para aquellos sin ninguna experiencia previa en programación. Esto se debe a que los lenguajes usados para diseñar modelos usan conceptos intrínsecos a los lenguajes de programación. En este Proyecto Fin de Carrera, describimos una herramienta que genera automáticamente modelos, dado un conjunto de requisitos inicial. La ventaja que ofrece esta herramienta es que los usuarios no requieren el aprendizaje de ninguno lenguaje de modelado a la hora de diseñar modelos, sino que tan solo deben aprender a utilizar una Interfaz de Usuario Gráfica (GUI), a un alto nivel de abstracción, para especificar sus test cases. Demostramos el valor de esta herramienta mediante su aplicación en un nuevo sistema de telecomunicaciones en fase de pruebas de Ericsson, mostrando al mismo tiempo que puede ser utilizada en el testeo de sistemas similares. La aplicación de esta herramienta puede facilitar los métodos de desarrollo de software tradicionales mediante el ahorro de una cantidad considerable de tiempo y recursos. Además, aplicada a métodos de desarrollo ágil de software, el tiempo reducido requerido para el testing a causa del uso de esta herramienta ayuda a acortar los plazos entre diseño y testing, y en consecuencia, incrementando la eficiencia del equipo en cada iteración.
19
Junke, Christophe. "Critères de test et génération de séquences de tests pour des systèmes réactifs synchrones modélisés par des équations flots de données et contrôlés par des automates étendus." Phd thesis, Ecole Centrale Paris, 2012. http://tel.archives-ouvertes.fr/tel-00680308.
Full textAbstract:
Nous nous intéressons aux approches formelles pour le développement de systèmes réactifs critiques. Le langage synchrone Lustre pour la spécification de tels systèmes a subit des évolutions majeurs au cours des dernières années en intégrant dans sa sémantique à base flots de données synchrones des constructions de plus haut-niveau appelées automates de modes (dans le langage Scade 6). Ceux-ci mettent en œuvre l'activation de modes de calculs en fonction des états et des transitions de l'automate, et reposent pour cela sur la sémantique des horloges du langage Lustre. En particulier, nous étudiions la prise en compte des horloges et des automates de modes dans l'outil de génération de tests GATeL dédié à l'origine au langage Lustre mono-horloge (flots de données purs). GATeL génère automatiquement des séquences de tests pour un modèle à partir d'un objectif de test décrit en Lustre à travers une exploration en arrière des dépendances entre flots et selon des teniques de résolution de contraintes. Nous présentons ces différents domaines et la mise en oeuvre des modifications apportées à l'outil pour prendre en compte les automates de modes. Enfin, nous définissons des critères de couverture structurelle pour les automates de modes et montrons alors comment, en les traduisant de manière automatique sous forme d'objectifs de tests, GATeL permet de générer des séquences couvrant ces critères.
20
Lin, Yuehua. "A model transformation approach to automated model evolution." Birmingham, Ala. : University of Alabama at Birmingham, 2007. http://www.mhsl.uab.edu/dt/2007p/lin.pdf.
Full text
21
Nguyen, Huu vu. "On CARET model-checking of pushdown systems : application to malware detection." Thesis, Sorbonne Paris Cité, 2018. http://www.theses.fr/2018USPCC061/document.
Full textAbstract:
Cette thèse s'attaque au problème de détection de malware en utilisant des techniques de model-checking: les automates à pile sont utilisés pour modéliser les programmes binaires, et la logique CARET (et ses variantes) sont utilisées pour représenter les comportements malicieux. La détection de malware est alors réduite au problème de model-checking des automates à pile par rapport à ces logiques CARET. Cette thèse propose alors différents algorithmes de model-checking des automates à pile par rapport à ces logiques CARET et montre comment ceci peut s'appliquer pour la détection de malwareThe number of malware is growing significantly fast. Traditional malware detectors based on signature matching or code emulation are easy to get around. To overcome this problem, model-checking emerges as a technique that has been extensively applied for malware detection recently. Pushdown systems were proposed as a natural model for programs, since they allow to keep track of the stack, while extensions of LTL and CTL were considered for malicious behavior specification. However, LTL and CTL like formulas don't allow to express behaviors with matching calls and returns. In this thesis, we propose to use CARET (a temporal logic of calls and returns) for malicious behavior specification. CARET model checking for Pushdown Systems (PDSs) was never considered in the literature. Previous works only dealt with the model checking problem for Recursive State Machine (RSMs). While RSMs are a good formalism to model sequential programs written in structured programming languages like C or Java, they become non suitable for modeling binary or assembly programs, since, in these programs, explicit push and pop of the stack can occur. Thus, it is very important to have a CARET model checking algorithm for PDSs. We tackle this problem in this thesis. We reduce it to the emptiness problem of Büchi Pushdown Systems. Since CARET formulas for malicious behaviors are huge, we propose to extend CARET with variables, quantifiers and predicates over the stack. This allows to write compact formulas for malicious behaviors. Our new logic is called Stack linear temporal Predicate logic of CAlls and RETurns (SPCARET). We reduce the malware detection problem to the model checking problem of PDSs against SPCARET formulas, and we propose efficient algorithms to model check SPCARET formulas for PDSs. We implemented our algorithms in a tool for malware detection. We obtained encouraging results. We then define the Branching temporal logic of CAlls and RETurns (BCARET) that allows to write branching temporal formulas while taking into account the matching between calls and returns and we proposed model-checking algorithms of PDSs for BCARET formulas. Finally, we consider Dynamic Pushdown Networks (DPNs) as a natural model for multithreaded programs with (recursive) procedure calls and thread creation. We show that the model-checking problem of DPNs against CARET formulas is decidable
22
Chalk, Matěj. "Nástroj pro abstraktní regulární model checking." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-385924.
Full textAbstract:
Formal verification methods offer a large potential to provide automated software correctness checking (based on sound mathematical roots), which is of vital importance. One such technique is abstract regular model checking, which encodes sets of reachable configurations and one-step transitions between them using finite automata and transducers, respectively. Though this method addresses problems that are undecidable in general, it facilitates termination in many practical cases, while also significantly reducing the state space explosion problem. This is achieved by accelerating the computation of reachability sets using incrementally refinable abstractions, while eliminating spurious counterexamples caused by overapproximation using a counterexample-guided abstraction refinement technique. The aim of this thesis is to create a well designed tool for abstract regular model checking, which has so far only been implemented in prototypes. The new tool will model systems using symbolic automata and transducers instead of their (less concise) classic alternatives.
23
Addazi, Lorenzo. "Automated Synthesis of Model Comparison Benchmarks." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-44333.
Full textAbstract:
Model-driven engineering promotes the migration from code-centric to model-based software development. Systems consist of model collections integrating different concerns and perspectives, while semi-automated model transformations generate executable code combining the information from these. Increasing the abstraction level to models required appropriate management technologies supporting the various software development activities. Among these, model comparison represents one of the most challenging tasks and plays an essential role in various modelling activities. Its hardness led researchers to propose a multitude of approaches adopting different approximation strategies and exploiting specific knowledge of the involved models. However, almost no support is provided for their evaluation against specific scenarios and modelling practices. This thesis presents Benji, a framework for the automated generation of model comparison benchmarks. Given a set of differences and an initial model, users generate models resulting from the application of the first on the latter. Differences consist of preconditions, actions and postconditions expressed using a dedicated specification language. The generator converts benchmark specifications to design-space exploration problems and produces the final solutions along with a model-based description of their differences with respect to the initial model. A set of representative use cases is used to evaluate the framework against its design principles, which resemble the essential properties expected from model comparison benchmark generators.
24
Schmid, Michael Sebastian. "Model-based certification of automated vehicles." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/127083.
Full textAbstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, May, 2020Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 121-131).
Automated vehicles (AVs) have long been predicted to disrupt the transportation industry any moment. Although numerous companies have shared that optimism and supported development, it now seems that the challenges of building automated vehicles are becoming apparent and are pushing the vision far into the future. While manufacturers are making technological progress there are concerns about the safety of AVs. For AVs new types of accidents such as accidents due to unsafe software behavior and interactions between vehicle hardware, software, and humans must be considered in addition to what has been done for the safety of conventional vehicles. Many stakeholders in the AV industry are looking for ways to ensure and demonstrate the safety of AV designs. For one, regulators are responsible for assessing safety and granting certification based on whether a minimum level of confidence in safety was achieved.
Similarly, manufacturers need to be able to argue for the safety of their AV design in order to receive certification and convince customers. Finally, suppliers such as software/hardware providers, AV app developers, etc., also depend on a way to demonstrate the safety of their product and convince Original Equipment Manufacturers (OEMs). Hence, safety is an important problem for the progress of the AV industry that calls for a solution. This thesis presents a potential solution by suggesting a model-based certification. First, currently existing problems with AV safety and the currently taken approaches to address AV safety are identified. Then, an alternative model-based safety approach that addresses the identified problems is demonstrated and a conceptual architecture model and safety requirements are derived. Finally, it is shown how the model-based safety approach may be implemented through certification.
The application to safety-related problems such as regulation and the insurance of AVs is outlined and an organizational structure and processes for model-based certification are derived.
by Michael Sebastian Schmid.
S.M.
S.M. Massachusetts Institute of Technology, Department of Aeronautics and Astronautics
25
Renault, Etienne. "Contribution aux tests de vacuité pour le model checking explicite." Thesis, Paris 6, 2014. http://www.theses.fr/2014PA066452/document.
Full textAbstract:
L'approche automate pour le model checking de propriétés temporelles à temps linéaire est une technique classique de vérification formelle de systèmes concurrents. Un système, ainsi qu'une propriété qu'on souhaite y vérifier, sont modélisés sous forme d’omega-automates reconnaissant des mots infinis. Des manipulations de ces automates (produit synchronisé et test de vacuité) permettent d'établir si le système vérifie la propriété ou non. Dans cette thèse nous nous focalisons sur un type particulier d'omega-automates qui permettent une représentation concise des propriétés d'équité faible: les automates de Büchi généralisés basés sur les transitions (TGBA ou Transition-based Generalized Büchi Automata). Dans un premier temps, nous brossons un aperçu des algorithmes de vérification existant et nous en proposons de nouveaux traitant efficacement les automates généralisés forts. Dans un second temps, l'analyse des composantes fortement connexes de l'automate de la propriété nous a conduit à élaborer une décomposition de cet automate. Cette décomposition se focalise sur les automates multi-forces et permet une parallélisation naturelle des model-checkers. Enfin, nous avons proposé les premiers tests de vacuité parallèles pour les automates généralisés. De plus, tous ces tests sont lock-free à la différence de ceux de l’état de l’art. Toutes ces techniques ont ensuite été implémentées et évaluées sur un jeu de test conséquentThe automata-theoretic approach to linear time model-checking is a standard technique for formal verification of concurrent systems. The system and the property to check are modeled with omega-automata that recognizes infinite words. Operations overs these automata (synchronized product and emptiness checks) allows to determine whether the system satisfies the property or not. In this thesis we focus on a particular type of omega-automata that enable a concise representation of weak fairness properties: transitions-based generalized Büchi automata (TGBA). First we outline existing verification algorithms, and we propose new efficient algorithms for strong automata. In a second step, the analysis of the strongly connected components of the property automaton led us to develop a decomposition of this automata. This decomposition focuses on multi-strength property automata and allows a natural parallelization for already existing model-checkers. Finally, we proposed, for the first time, new parallel emptiness checks for generalized Büchi automata. Moreover, all these emptiness checks are lock-free, unlike those of the state-of-the-art. All these techniques have been implemented and then evaluated on a large benchmark
26
Hague, Matthew. "Saturation methods for global model-checking pushdown systems." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76.
Full textAbstract:
Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Model-checking for pushdown systems has been well-studied. Tools implementing pushdown model-checking (e.g. Moped) are an essential back-end component of high-profile software model checkers such as SLAM, Blast and Terminator. Higher-order pushdown systems define a more complex memory structure: a higher-order stack is a stack of lower-order stacks. These systems form a robust hierarchy closely related to the Caucal hierarchy and higher-order recursion schemes. This latter connection demonstrates their importance as models for programs with higher-order functions. We study the global model-checking problem for (higher-order) pushdown systems. In particular, we present a new algorithm for computing the winning regions of a parity game played over an order-1 pushdown system. We then show how to compute the winning regions of two-player reachability games over order-n pushdown systems. These algorithms extend the saturation methods of Bouajjani, Esparza and Maler for order-1 pushdown systems, and Bouajjani and Meyer for higher-order pushdown systems with a single control state. These techniques begin with an automaton recognising (higher-order) stacks, and iteratively add new transitions until the automaton becomes saturated. The reachability result, presented at FoSSaCS 2007 and in the LMCS journal, is the main contribution of the thesis. We break the saturation paradigm by adding new states to the automaton during the iteration. We identify the fixed points required for termination by tracking the updates that are applied, rather than by observing the transition structure. We give a number of applications of this result to LTL model-checking, branching-time model-checking, non-emptiness of higher-order pushdown automata and Büchi games. Our second major contribution is the first application of the saturation technique to parity games. We begin with a mu-calculus characterisation of the winning region. This formula alternates greatest and least fixed point operators over a kind of reachability formula. Hence, we can use a version of our reachability algorithm, and modifications of the Büchi techniques, to compute the required result. The main advantages of this approach compared to existing techniques due to Cachat, Serre and Vardi et al. are that it is direct and that it is not immediately exponential in the number of control states, although the worst-case complexity remains the same.
27
Shelton, Debra Kay. "A selection model for automated guided vehicles." Thesis, Virginia Polytechnic Institute and State University, 1985. http://hdl.handle.net/10919/101465.
Full textAbstract:
This research identifies the attributes to be considered in the selection of an automated guided vehicle (AGV). A distinction is made between automated guided vehicles (AGVs) and an automated guided vehicle system (AGVS). This research is concerned only with the selection of automated guided vehicles (AGVs).
A selection model is developed which forces the user to evaluate attributes. his requirements and preferences for AGV The first step of the model allows the user to enter his specifications for AGV attributes which are applicable to his production environment. The second step in the selection model is for the user to determine 8-15 attributes to use as selection criteria. In the third phase, the user inputs his preferences and priorities with respect to the attributes chosen as selection criteria in the second step. model ranks the Based on this information, the selection AGV models in the feasible set. A description of the model and a numerical example are included.
Steps 1 and 2, described above, are implemented using an R:BASE™ program. The BASIC computer language was used to perform the interrogation of the user with respect to his priorities and preferences among attributes in Step 3. The IBM PC™ is the hardware chosen for running the selection model.M.S.
28
Heussner, Alexander. "Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions." Thesis, Bordeaux 1, 2011. http://www.theses.fr/2011BOR14278/document.
Full textAbstract:
La vérification de propriétés de sûreté des logiciels distribués basés sur des canaux fifo non bornés et fiables mène directement au model checking de systèmes infinis. Nous introduisons la famille des (q)ueueing (c)oncurrent (p)rocesses (QCP) composant des systèmes de transitions locaux, par exemple des automates finis/à pile, qui communiquent entre eux par des files fifo. Le problème d'atteignabilité des états de contrôle est indécidable pour des automates communicants et des automates à plusieurs piles, et par conséquent pour QCP.Nous présentons deux solutions pour contourner ce résultat négatif :Primo, une sur-approximation basée sur l'approche abstraire-tester-raffiner qui s'appuie sur notre nouveau concept de raffinement par chemin. Cette approche mène à permettre d'écrire un semi-algorithme du type CEGAR qui est implémenté avec des QDD et réalisé dans le framework McScM dont le banc d'essai conclut notre présentation.Secundo, nous proposons des restrictions pour les QCP à des piles locales pour démêler l'interaction causale entre les données locales (la pile), et la synchronisation globale. Nous montrons qu'en supposant qu'il existe une borne existentielle sur les exécutions et qu'en ajoutant une condition sur l'architecture, qui entrave la synchronisation de deux piles, on arrive à une réponse positive pour le problème de décidabilité de l'atteignabilité qui est EXPTime-complet (et qui généralise des résultats déjà connus). La construction de base repose sur une simulation du système par un automate à une pile équivalent du point de vue de l'atteignabilité --- sous-jacente, nos deux restrictions restreignent les exécutions à une forme hors-contexte. Nous montrons aussi que ces contraintes apparaissent souvent dans des situations ``concrètes''et qu'elles sont moins restrictives que celles actuellement connues. Une autre possibilité pour arriver à une solution pratiquement utilisable consiste à supposer une borne du problème de décidabilité : nous montrons que l'atteignabilité par un nombre borné de phases est décidable par un algorithme constructif qui est 2EXPTime-complet.Finalement, nous montrons qu'élargir les résultats positifs ci-dessus à la vérification de la logique linéaire temporelle demande soit de sacrifier l'expressivité de la logique soit d'ajouter des restrictions assez fortes aux QCP --- deux restrictions qui rendent cette approche inutilisable en pratique. En réutilisant notre argument de type ``hors-contexte'', nous représentons l'ordre partiel sous-jacent aux exécutions par des grammaires hypergraphes. Cela nous permet de bénéficier de résultats connus concertant le model checking des formules de la logique MSO sur les graphes (avec largeur arborescente bornée), et d'arriver aux premiers résultats concernant la vérification des propriétés sur l'ordre partiel des automates (à pile) communicantsThe safety verification of distributed programs, that are based on reliable, unbounded fifo communication, leads in a straight line to model checking of infinite state systems. We introduce the family of (q)ueueing (c)oncurrent (p)rocesses (QCP): local transition systems, e.g., (pushdown-)automata, that are globally communicating over fifo channels. QCP inherits thus the known negative answers to the control-state reachability question from its members, above all from communicating automata and multi-stack pushdown systems. A feasible resolution of this question is, however, the corner stone for safety verification.We present two solutions to this intricacy: first, an over-approximation in the form of an abstract-check-refine algorithm on top of our novel notion of path invariant based refinement. This leads to a \cegar semi-algorithm that is implemented with the help of QDD and realized in a small software framework (McScM); the latter is benchmarked on a series ofsmall example protocols. Second, we propose restrictions for QCP with local pushdowns that untangle the causal interaction of local data, i.e., thestack, and global synchronization. We prove that an existential boundedness condition on runs together with an architectural restriction, that impedes the synchronization of two pushdowns, is sufficient and leads to an EXPTime-complete decision procedure (thus subsuming and generalizing known results). The underlying construction relies on a control-state reachability equivalent simulation on a single pushdown automaton, i.e., the context-freeness of the runs under the previous restrictions. We can demonstrate that our constraints arise ``naturally'' in certain classes of practical situations and are less restrictive than currently known ones. Another possibility to gain a practicable solution to safety verification involves limiting the decision question itself: we show that bounded phase reachability is decidable by a constructive algorithms in 2ExpTime, which is complete.Finally, trying to directly extend the previous positive results to model checking of linear temporal logic is not possible withouteither sacrificing expressivity or adding strong restrictions (i.e., that are not usable in practice). However, we can lift our context-freeness argument via hyperedge replacement grammars to graph-like representation of the partial order underlying each run of a QCP. Thus, we can directly apply the well-known results on MSO model checking on graphs (of bounded treewidth) to our setting and derive first results on verifying partial order properties on communicating (pushdown-) automata
29
Tran, Van Nhu. "Amélioration de l'agrément de conduite via le pilotage du groupe motopropulseur." Phd thesis, Université de Valenciennes et du Hainaut-Cambresis, 2013. http://tel.archives-ouvertes.fr/tel-00871807.
Full textAbstract:
La transmission à double embrayage a été introduite dans les véhicules afin d'améliorer le confort de conduit, l'économie de conduite et de diminuer le temps de changement de vitesses. La gestion du double embrayage joue un rôle important sur le confort de conduite. L'objectif principal de ce travail concerne alors la synthèse des lois de commande du double embrayage en phase de décollage et lors du changement de vitesses. Le mémoire est structuré de la façon suivante : le premier chapitre propose un état de l'art sur le groupe motopropulseur, la modélisation et la commande du groupe motopropulseur. Le second chapitre s'intéresse à la modélisation du groupe motopropulseur à double embrayage : dans une première partie, un modèle complet à simuler est développé, puis la deuxième partie propose une simplification de modèle en vue de la commande. Le troisième chapitre aborde les lois de commande du double embrayage en utilisant la technique de commande par mode glissant pour les systèmes multivariables. Le quatrième chapitre propose l'utilisation des modèles flous du type Takagi-Sugeno pour la synthèse des lois de commande. Dans une première partie, des lois de commande basées sur un modèle Takagi-Sugeno prenant en compte des incertitudes et des perturbations sont établies. Afin d'améliorer la performance de la loi de commande lors du changement de vitesses supérieures, la deuxième partie présente une loi de commande basée sur un modèle de Takagi-Sugeno incertain et perturbé à commutations. Enfin, des résultats de simulation obtenus en considérant le modèle complet développé dans le chapitre 2 sont donnés.
30
Ligon, Thomas (Thomas Crumrine). "Automated inter-model parameter connection synthesis for simulation model integration." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/39887.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2007.Includes bibliographical references (p. 73-75).
New simulation modeling environments have been developed such that multiple models can be integrated into a single model. This conglomeration of model data allows designers to better understand the physical phenomenon being modeled. Models are integrated together by creating connections between their interface parameters, referred to as parameter mapping, that are either shared by common models or flow from the output of one model to the input of a second model. However, the process of integrating simulation models together is time consuming, and this development time can outweigh the benefit of the increased understanding. This thesis presents two algorithms that are designed to automatically generate and suggest these parameter mappings. The first algorithm attempts to identify previously built integration model templates that have a similar function. Model interfaces and integration models are represented by attributed graphs. Interface graph nodes represent interface parameters and arcs relate the input and output parameters, and integration models graph nodes represent interface graphs and arc represent parametric connections between interface graph nodes.
(cont.) A similarity based pattern matching algorithm initially compares interface graphs in two integration model graphs. If the interface graphs are found to match, the algorithm attempts to apply the template integration model's parameter mappings to the new integration model. The second algorithm compares model interface parameters directly. The algorithm uses similarity measures developed for the pattern matching algorithm to compare model parameters. Parameter pairs that are found to be very similar are processed using a set of model integration rules and logic and those pairs that fit these criteria are mapped together. These algorithms were both implemented in JAVA and integrated into the modeling environment DOME (Distributed Object-based Modeling Environment). A small set of simulation models were used to build both new and template integration models in DOME. Tests were conducted by recording the time required to build these integration models manually and using the two proposed algorithms. Integration times were generally ten times faster but some inconsistencies and mapping errors did occur. In general the results are very promising, but a wider variety of models should be used to test these two algorithms.
by Thomas Ligon.
S.M.
31
Knotek, Michal. "Diagnostic de fautes basé sur l'analyse temporelle." Phd thesis, Université Joseph Fourier (Grenoble), 2006. http://tel.archives-ouvertes.fr/tel-00110429.
Full textAbstract:
Dans le domaine de la sûreté de fonctionnement, le diagnostic joue un rôle primordial dans l'amélioration de la disponibilité opérationnel le
des équipements. Dans les systèmes industriels, une part importante
(jusqu'à 80%) est consacrée à la maintenance, test et diagnostic. Pour
des systèmes complexes, la résolution des problèmes liés au diagnostic
et d'une manière générale de la supervision nécessite la mise en oeu-
vre d'une approche générique. Le diagnostic concerne les deux phases
indissociables de détection et de localisation. Dans cette thèse nous
proposons une approche dynamique de diagnostic pour les systèmes à
événements discrets. L'approche proposée basée sur l'exploitation du
temps, est applicable à tout système dont l'évolution dynamique dépend
non seulement de l'ordre des événements discrets mais aussi de la durée
des tâches associées comme pour les processus de communication ou les
processus batch. Dans cette thèse, le diagnostic des fautes est réalisé
grâce à l'implémentation d'un modèle basé sur l'utilisation des auto-
mates temporisés. L'objectif est de concevoir un observateur pour un
système donné, qui permet de détecter et localiser les éventuel les dé-
fail lances du procédé. Cet observateur est appelé “diagnoser”. Une
défail lance est constatée lorsque le séquencement temporel en sortie est
incorrect. Nous présentons donc les différentes étapes de la démarche
de diagnostic : la construction du diagnoser, la vérification du modèle
ainsi qu'une l'application de la démarche sur un exemple réel avec son
extension aux systèmes hybrides.
32
Mihoubi, Douadi. "Modes de reconnaissance et équités dans les automates de mots infinis." Paris 13, 1989. http://www.theses.fr/1989PA132013.
Full textAbstract:
L'extension des grammaires linéaires et automates à pic aux ensembles de mots infinis est étudiée. Caractérisations de langages de mots infinis reconnus par des automates à pic. Etude des propriètés de fermeture de ces langages par les opérations booléennes et topologiques. Extension des concepts d'équités décrites sur: les systèmes de transitions finis, processus SCCS régulier et grammaires algébriques respectivement aux automates à pic, systèmes de N processus finis et à pic, et grammaires linéaires et bilinéaires
33
Kattenbelt, Mark Alex. "Automated quantitative software verification." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:62430df4-7fdf-4c4f-b3cd-97ba8912c9f5.
Full textAbstract:
Many software systems exhibit probabilistic behaviour, either added explicitly, to improve performance or to break symmetry, or implicitly, through interaction with unreliable networks or faulty hardware. When employed in safety-critical applications, it is important to rigorously analyse the behaviour of these systems. This can be done with a formal verification technique called model checking, which establishes properties of systems by algorithmically considering all execution scenarios. In the presence of probabilistic behaviour, we consider quantitative properties such as "the worst-case probability that the airbag fails to deploy within 10ms", instead of qualitative properties such as "the airbag eventually deploys". Although many model checking techniques exist to verify qualitative properties of software, quantitative model checking techniques typically focus on manually derived models of systems and cannot directly verify software. In this thesis, we present two quantitative model checking techniques for probabilistic software. The first is a quantitative adaptation of a successful model checking technique called counter-example guided abstraction refinement which uses stochastic two-player games as abstractions of probabilistic software. We show how to achieve abstraction and refinement in a probabilistic setting and investigate theoretical extensions of stochastic two-player game abstractions. Our second technique instruments probabilistic software in such a way that existing, non-probabilistic software verification methods can be used to compute bounds on quantitative properties of the original, uninstrumented software. Our techniques are the first to target real, compilable software in a probabilistic setting. We present an experimental evaluation of both approaches on a large range of case studies and evaluate several extensions and heuristics. We demonstrate that, with our methods, we can successfully compute quantitative properties of real network clients comprising approximately 1,000 lines of complex ANSI-C code — the verification of such software is far beyond the capabilities of existing quantitative model checking techniques.
34
Shah, Seyyed Madasar Ali. "Model transformation dependability evaluation by the automated creation of model generators." Thesis, University of Birmingham, 2012. http://etheses.bham.ac.uk//id/eprint/3407/.
Full textAbstract:
This thesis is on the automatic creation of model generators to assist the validation of model transformations. The model driven software development methodology advocates models as the main artefact to represent software during development. Such models are automatically converted, by transformation tools, to apply in different stages of development. In one application of the method, it becomes possible to synthesise software implementations from design models. However, the transformations used to convert models are man-made, and so prone to development error. An error in a transformation can be transmitted to the created software, potentially creating many invalid systems. Evaluating that model transformations are reliable is fundamental to the success of modelling as a principle software development practice. Models generated via the technique presented in this thesis can be applied to validate transformations. In several existing transformation validation techniques, some form of conversion is employed. However, those techniques do not apply to validate the conversions used there-in. A defining feature of the current presentation is the utilization of transformations, making the technique self-hosting. That is, an implementation of the presented technique can create generators to assist model transformations validation and to assist validation of that implementation of the technique.
35
Bundy, Geraint Llewellyn. "Automated cartographic generalization with a triangulated spatial model." Thesis, University of South Wales, 1996. https://pure.southwales.ac.uk/en/studentthesis/automated-cartographic-generalization-with-a-triangulated-spatial-model(754893a1-faae-4191-9e36-a15854deb36d).html.
Full textAbstract:
This thesis describes a doctoral project which has addressed some of the problems of automatically performing cartographic generalization in a holistic manner, that is, processing the map features in the context of the whole map rather than individual features in isolation. The approach is based on two key ideas: firstly, that the map surface can be represented by a structure based on simplicial complexes which provides useful relationships for topology and proximity and facilitates many of the fundamental generalization operations. Secondly, that the epistemological structures needed for generalization can be represented by a hierarchy of "context" frames, each of which encapsulate the knowledge required to recognize, generalize and resolve a cartographic situation. A data structure that uses simplicial complexes to represent map objects has been designed and implemented. Each object is described by a set of two-dimensional simplices (triangles) that are maintained in the form of a constrained Delaunay triangulation. This structure gives a fully connected two-dimensional plenum that stores important spatial relationships such as "enclosed", "adjacent" and "between" explicitly. This simplicial data structure (SDS), as it is called, can be used directly to perform several types of operations necessary for automatic generalization, for example, automatic overlap detection, displacement, merging, enlargement, simplification of building outlines and skeletonization. Algorithms for many of these operators have been implemented while others are proposed. Pseudo-code and descriptions are used to document many of these operators, results are given and discussed. A frame-based architecture is proposed which provides a framework for the representation and application of knowledge for generalization. The project was funded by an EPSRC CASE studentship in collaboration with the Ordnance Survey.
36
Kara, Ismihan Refika. "Automated Navigation Model Extraction For Web Load Testing." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613992/index.pdf.
Full textAbstract:
Web pages serve a huge number of internet users in nearly every area. An
adequate testing is needed to address the problems of web domains for more efficient
and accurate services. We present an automated tool to test web applications against
execution errors and the errors occured when many users connect the same server
concurrently. Our tool, called NaMoX, attains the clickables of the web pages, creates a
model exerting depth first search algorithm. NaMoX simulates a number of users, parses
the developed model, and tests the model by branch coverage analysis. We have
performed experiments on five web sites. We have reported the response times when a
click operation is eventuated. We have found 188 errors in total. Quality metrics are
extracted and this is applied to the case studies.
37
Tufvesson, Hampus. "Impact of automated validation on software model quality." Thesis, Linköpings universitet, Programvara och system, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-92125.
Full textAbstract:
Model driven development is gaining momentum, and thus, larger and more complex systems are being represented and developed with the help of modeling. Complex systems often suffer from a number of problems such as difficulties in keeping the model understandable, long compilation times and high coupling. With modeling comes the possibility to validate the models against constraints, which makes it possible to handle problems that traditional static analysis tools can't solve. This thesis is a study on to what degree the usage of automatic model validation can be a useful tool in addressing some of the problems that appear in the development of complex systems. This is done by compiling a list of validation constraints based on existing problems, implementing and applying fixes for these and measuring how a number of different aspects of the model is affected. After applying the fixes and measuring the impact on the models ,it could be seen that validation of dependencies can have a signicant impact on the models by reducing build times of the generated code. Other types of validation constraints require further study to decide what impact they might have on model quality.
38
Loer, Karsten. "Model-based automated analysis for dependable interactive systems." Thesis, University of York, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399265.
Full text
39
Mahtab, Tazeen 1981. "Automated verification of model-based programs under uncertainty." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/28453.
Full textAbstract:
Thesis (M. Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.Includes bibliographical references (p. 89-91).
Highly robust embedded systems have been enabled through software executives that have the ability to reason about their environment. Those that employ the model-based autonomy paradigm automatically diagnose and plan future actions, based on models of themselves and their environment. This includes autonomous systems that must operate in harsh and dynamic environments, like, deep space. Such systems must be robust to a large space of possible failure scenarios. This large state space poses difficulties for traditional scenario-based testing, leading to a need for new approaches to verification and validation. We propose a novel verification approach that generates an analysis of the most likely failure scenarios for a model-based program. By finding only the lost likely failures, we increase the relevance and reduce the quantity of information the developer must examine. First, we provide the ability to verify a stochastic system that encodes both off-nominal and nominal scenarios. We incorporate uncertainty into the verification process by acknowledging that all such programs may fail, but in different ways, with different likelihoods. The verification process is one of finding the most likely executions that fail the specification. Second, we provide a capability for verifying executable specifications that are fault-aware. We generalize offline plant model verification to the verification of model-based programs, which consist of both a plant model that captures the physical plant's nominal and off-nominal states and a control program that specifies its desired behavior. Third, we verify these specifications through execution of the RMPL executive itself. We therefore circumvent the difficulty of formalizing the behavior of complex
(cont.) software executives. We present the RMPL Verifier, a tool for verification of model-based programs written in the Reactive Model-based Programming Language (RMPL) for the Titan execution kernel. Using greedy forward-directed search, this tool finds as counterexamples to the program's goal specification the most likely executions that do not achieve the goal within a given time bound.
by Tazeen Mahtab.
M.Eng.and S.B.
40
de, Araujo Rodrigues Vieira Elisangela. "Automated model-based test generation for timed systems." Evry, Institut national des télécommunications, 2007. http://www.theses.fr/2007TELE0011.
Full textAbstract:
Timed Systems are systems with real-time constraints. The correctness of a timed system depends not only upon the operations it performs but also the timing when they are performed. Testing a system aims to guarantee its correctness. Model-based test generation is an approach to generate test cases based on a formal model. Although test generation methods have been far proposed, its timed counterpart is still a new field. In addition, most of the proposed solutions suffer from combinatory explosion which still limits their applicability in practice. Accordingly, it explains why there are so few automatic formal methods for testing generation, for both time and untimed systems. This thesis presents an automatic test generation approach addressed for timed systems using a test-purpose algorithm. Test purpose approach guarantees the generation of test case with regard to critical parts of the system and avoid the state explosion problem. In addition, we propose techniques to generate test sequences with timing-fault detection and with delayed and/or instantaneous transitions. In order to evaluate the applicability and efficiency of the proposed method, we have implemented two prototype tools: one based on an industrial simulator for SDL specifications and other using a free toolset based on IF models. Two real industrial applications are used as case study: a Railroad Crossing and a Vocal Service furnished by France TelecomLes systèmes temporisés sont des systèmes avec des contraintes de temps réel. L'exactitude d'un système temporisé dépend non seulement des opérations qu'il effectue mais également de la synchronisation quand ils sont exécutés. La synchronisation prend en compte non seulement l’ordre des opérations mais surtout le moment quand elles sont exécutées. Tester un système vise à garantir son exactitude. La génération de teste basée sur des modèles c’est une approche pour produire des cas de test basés sur un modèle formel. Bien que d’autres méthodes de génération de test ont déjà été proposés, la génération pour les systèmes temporisés c’est un domaine bien plus récente. En outre, la plupart des solutions proposées souffrent de l'explosion combinatoire, ce qui limite toujours leur applicabilité dans la pratique. En conséquence, cela explique pourquoi il y a tellement peu de méthodes formelles automatiques pour la génération de test dans tout les domaines. Cette thèse présente une approche automatique de génération de teste adressée aux systèmes temporisés. Pour cela, nous proposons un algorithme de génération basé sur des objectives de test. Cette approche permet de générer des tests pour ce qui concerne les parties critiques du système et évite le problème d'explosion combinatoire. En outre, nous proposons des techniques pour produire des tests avec la détection des timing faults et avec des transitions retardées et/ou instantanées. Afin d'évaluer l'applicabilité et l'efficacité de la méthode proposée, nous avons mis en oeuvre deux outils: une en utilisant un simulateur industriel, pour des modèles en LDS et une autre employant un simulateur basé sur le langage IF. Deux applications industrielles sont employées comme étude de cas : Un système de Passage à Niveau et un Service Vocal fourni par France Telecom
41
Abdul, Sani Asmiza. "Towards automated formal analysis of model transformation specifications." Thesis, University of York, 2013. http://etheses.whiterose.ac.uk/8641/.
Full textAbstract:
In Model-Driven Engineering, model transformation is a key model management operation, used to translate models between notations. Model transformation can be used for many engineering activities, for instance as a preliminary to merging models from different meta- models, or to generate codes from diagrammatic models. A mapping model needs to be developed (the transformation specification) to represent relations between concepts from the metamodels. The evaluation of the mapping model creates new challenges, for both conventional verification and validation, and also in guaranteeing that models generated by applying the transformation specification to source models still retain the intention of the initial transformation requirements. Most model transformation creates and evaluates a transformation specification in an ad-hoc manner. The specifications are usu- ally unstructured, and the quality of the transformations can only be assessed when the transformations are used. Analysis is not systematically applied even when the transformations are in use, so there is no way to determine whether the transformations are correct and consistent. This thesis addresses the problem of systematic creation and analysis of model transformation, via a facility for planning and designing model transformations which have conceptual-level properties that are tractable to formal analysis. We proposed a framework that provides steps to systematically build a model transformation specification, a visual notation for specifying model transformation and a template-based approach for producing a formal specification that is not just structure-equivalent but also amenable to formal analysis. The framework allows evaluation of syntactic and semantic correctness of generated models, metamodel coverage, and semantic correctness of the transformations themselves, with the help of snapshot analysis using patterns.
42
Bel, Mokadem Houda. "Vérification des propriétés temporisées des automates programmables industriels." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2006. http://tel.archives-ouvertes.fr/tel-00132057.
Full textAbstract:
De nombreux sytèmes critiques comportent des aspects temporisés, où interviennent de manière cruciale des contraintes quantitatives sur les délais séparant certaines actions. Un automate programmable industriel (API) constitue un composant fondamental d'un système souvent critique destiné à réagir et à communiquer en temps réel avec son environnement. Ma thèse se situe dans le contexte de la vérification de propriétés temporisées des APIS. Plus précisement, on propose une sémantique formelle à base d'automates temporisés pour la modélisation d'une sous classe de programmes Ladder comportant des blocs TON. On fournie une logique temporisée dont la sémantique permet de considérer seulement les événements "signifcatifs" (c'est à dire les événements qui durent suffisamment longtemps). On propose deux sémantiques différentes pour cette logique: sémantique "locale" et sémantique "globale". Pour la sémantique "locale", on a obtenu plusieurs résultats d'expressivité et grâce à une nouvelle relation d'équivalence, on montre que son model checking reste décidable sans modifier la complexité théorique. En revanche, pour la sémantique "globale", le model checking devient indécidable.
43
PENG, SISI. "Evaluating Automatic Model Selection." Thesis, Uppsala universitet, Statistiska institutionen, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-154449.
Full textAbstract:
In this paper, we briefly describe the automatic model selection which is provided by Autometrics in the PcGive program. The modeler only needs to specify the initial model and the significance level at which to reduce the model. Then, the algorithm does the rest. The properties of Autometrics are discussed. We also explain its background concepts and try to see whether the model selected by the Autometrics can perform well. For a given data set, we use Autometrics to find a “new” model, and then compare the “new” model with a previously selected one by another modeler. It is an interesting issue to see whether Autometrics can also find models which fit better to the given data. As an illustration, we choose three examples. It is true that Autometrics is labor saving and always gives us a parsimonious model. It is really an invaluable instrument for social science. But, we still need more examples to strongly support the idea that Autometrics can find a model which fits the data better, just a few examples in this paper is far from enough.
44
Sen, Sagar. "Automatic effective model discovery." Rennes 1, 2010. http://www.theses.fr/2010REN1S042.
Full textAbstract:
Les découvertes scientifiques aboutissent souvent à la représentation de structures dans l’environnement sous forme de graphes d’objets. Par exemple, certains réseaux de réactions biologiques visent à représenter les processus vitaux tels que la consommation de gras ou l’activation/désactivation des gênes. L’extraction de connaissances à partir d'expérimentations, l'analyse des données et l’inférence conduisent à la découverte de structures effectives dans la nature. Ce processus de découverte scientifiques peut-il être automatisé au moyen de diverses sources de connaissances? Dans cette thèse, nous abordons la même question dans le contexte contemporain de l'ingénierie dirigée par les modèles (IDM) de systèmes logiciels complexes. L’IDM vise à accélérer la création de logiciels complexes en utilisant de artefacts de base appelés modèles. Tout comme le processus de découverte de structures effectives en science un modeleur crée dans un domaine de modélisation des modèles effectifs, qui représente des artefacts logiciels utiles. Dans cette thèse, nous considérons deux domaines de modélisation: métamodèles pour la modélisation des langages et des feature diagrams pour les lignes de produits (LPL) logiciels. Pouvons-nous automatiser la découverte de modèles effectifs dans un domaine de modélisation? Le principal défi dans la découverte est la génération automatique de modèles. Les modèles sont des graphes d’objets interconnectés avec des contraintes sur leur structure et les données qu'ils contiennent. Ces contraintes sont imposées par un domaine de modélisation et des sources hétérogènes de connaissances, incluant plusieurs règles de bonne formation. Comment pouvons-nous générer automatiquement des modèles qui satisfont ces contraintes? Dans cette thèse, nous présentons un framework dirigé par les modèles pour répondre à cette question. Le framework pour la découverte automatique de modèles utilise des sources hétérogènes de connaissances pour construire, dans un premier temps, un sous-ensemble concis et pertinent d’une spécification du domaine de modélisation appelée domaine de modélisation effectif. Ensuite, il transforme le domaine de modélisation effectif défini dans différents langages vers un problème de satisfaction de contraintes dans le langage de spécification formel Alloy. Enfin, le framework invoque un solveur sur le modèle Alloy pour générer un ou plusieurs modèles effectifs. Nous incorporons le framework dans deux outils: Cartier pour la découverte de modèles a partir de n’importe quel langage de modélisation et Avishkar pour la découverte de produits dans une LPL. Nous validons notre framework par des expérimentations rigoureuses pour la génération de test, la complétion de modèles partiel, la génération de produits, et la génération d’orchestrations web service. Les résultats montrent que notre framework génère systématiquement des solutions effectives dans des domaines de modélisation à partir de cas d’étude significatifsScientific discovery often culminates into representing structure in nature as networks (graphs) of objects. For instance, certain biological reaction networks aim to represent living processes such as burning fat or switching genes on/off. Knowledge from experiments, data analysis and mental tacit lead to the discovery of such effective structures in nature. Can this process of scientific discovery using various sources of knowledge be automated? In this thesis, we address the same question in the contemporary context of model-driven engineering (MDE) of complex software systems. MDE aims to grease the wheels of complex software creation using first class artifacts called models. Very much like the process of effective structure discovery in science a modeler creates effective models, representing useful software artifacts, in a modelling domain. In this thesis, we consider two such modelling domains: metamodels for modelling languages and feature diagrams for Software Product Lines (SPLs). Can we automate effective model discovery in a modelling domain? The central challenge in discovery is the automatic generation of models. Models are graphs of inter-connected objects with constraints on their structure and the data contained in them. These constraints are enforced by a modelling domain and heterogeneous sources of knowledge including several well-formedness rules. How can we automatically generate models that simultaneously satisfy these constraints? In this thesis, we present a model-driven framework to answer this question. The framework for automatic model discovery uses heterogeneous sources of knowledge to first setup a concise and relevant subset of a modelling domain specification called the effective modelling domain. Next, it transforms the effective modelling domain defined in possibly different languages to a constraint satisfaction problem in the unique formal specification language Alloy. Finally, the framework invokes a solver on the Alloy model to generate one or more effective models. We embody the framework in two tools: Cartier for model discovery in any modelling language and Avishkar for product discovery in a SPL. We validate our framework through rigorous experiments in test model generation, partial model completion, product generation in SPLs, and generation of web-service orchestrations. The results qualify that our framework consistently generates effective findings in modelling domains from commensurate case studies
45
Delgado, Diogo Miguel Melo. "Automated illustration of multimedia stories." Master's thesis, Faculdade de Ciências e Tecnologia, 2010. http://hdl.handle.net/10362/4478.
Full textAbstract:
Submitted in part fulfillment of the requirements for the degree of Master in Computer ScienceWe all had the problem of forgetting about what we just read a few sentences before. This comes from the problem of attention and is more common with children and the elderly. People feel either bored or distracted by something more interesting. The challenge is how can multimedia systems assist users in reading and remembering stories? One solution is to use pictures to illustrate stories as a mean to captivate ones interest as it either tells a story or makes the viewer imagine one. This thesis researches the problem of automated story illustration as a method to increase the readers’ interest and attention. We formulate the hypothesis that an automated multimedia system can help users in reading a story by stimulating their reading memory with adequate visual illustrations. We propose a framework that tells a story and attempts to capture the readers’ attention by providing illustrations that spark the readers’ imagination. The framework automatically creates a multimedia presentation of the news story by (1) rendering news text in a sentence by-sentence fashion, (2) providing mechanisms to select the best illustration for each sentence and (3) select the set of illustrations that guarantees the best sequence. These mechanisms are rooted in image and text retrieval techniques. To further improve users’ attention, users may also activate a text-to-speech functionality according to their preference or reading difficulties. First experiments show how Flickr images can illustrate BBC news articles and provide a better experience to news readers. On top of the illustration methods, a user feedback feature was implemented to perfect the illustrations selection. With this feature users can aid the framework in selecting more accurate results. Finally, empirical evaluations were performed in order to test the user interface,image/sentence association algorithms and users’ feedback functionalities. The respective results are discussed.
46
Hugot, Vincent. "Tree automata, approximations, and constraints for verification : Tree (Not quite) regular model-checking." Phd thesis, Université de Franche-Comté, 2013. http://tel.archives-ouvertes.fr/tel-00909608.
Full textAbstract:
Tree automata, and their applications to verification from the common thread of this thesis In the first part, we definie a complete model-cheking framework.[...] The second part focus on an important aspect of the automata involved: constraints.[...] Finaly, we also study the very different variety of tree-walking automata which have tight connections with navigational languages on semi-structured documents.
47
Missakian, Mario Sarkis. "Automated Support for Model Selection Using Analytic Hierarchy Process." NSUWorks, 2011. http://nsuworks.nova.edu/gscis_etd/249.
Full textAbstract:
Providing automated support for model selection is a significant research challenge in model management. Organizations maintain vast growing repositories of analytical models, typically in the form of spreadsheets. Effective reuse of these models could result in significant cost savings and improvements in productivity. However, in practice, model reuse is severely limited by two main challenges: (1) lack of relevant information about the models maintained in the repository, and (2) lack of end user knowledge that prevents them from selecting appropriate models for a given problem solving task. This study built on the existing model management literature to address these research challenges. First, this research captured the relevant meta-information about the models. Next, it identified the features based on which models are selected. Finally, it used Analytic Hierarchy Process (AHP) to select the most appropriate model for any specified problem. AHP is an established method for multi-criteria decision-making that is suitable for the model selection task. To evaluate the proposed method for automated model selection, this study developed a simulated prototype system that implemented this method and tested it in two realistic end-user model selection scenarios based on previously benchmarked test problems.
48
Mohammadridha, Taghreed. "Automatic Glycemia Regulation of Type I Diabetes." Thesis, Ecole centrale de Nantes, 2017. http://www.theses.fr/2017ECDN0008.
Full textAbstract:
Cette thèse étudie le contrôle en boucle fermée pour la régulation de la glycémie du diabète de type 1 (DT1). Deux catégories principales de commande sont conçues: l'une est basée sur un modèle et l'autre non. Pour tester leur efficacité, les deux types sont testés in silico sur deux simulateurs de DT1. Le premier est un modèle à long terme qui est dérivé des données cliniques des sujets de DT1 et le second est le simulateur Uva/Padova. Tout d'abord, la commande sans modèle (CSM) est conçue. Après avoir montré qu'un régulateur proportionnel intelligent (iP) à référence constante peut être mis en défaut sur un simple second ordre, nous avons conçu un régulateur iP à référence variable. Une solution alternative est un régulateur proportionnel-intégral-dérivé intelligent (iPID) à référence constante. Une meilleure performance globale est obtenue avec iPID par rapport à iP et par rapport à un PID classique. Deuxièmement, une commande par modes glissants (CMG) garantie positive est conçue pour la première fois pour la régulation de la glycémie. La conception de cette commande est basée sur un modèle. La commande CMG est choisie pour la régulation de la glycémie en raison de ses propriétés de robustesse bien connues. Cependant, notre contribution majeure est l'assurance d'une commande rigoureusement positive. La commande CMG est conçue pour être positive partout dans un ensemble invariant du sous-système d'insulinémie du plasma. Enfin, un régulateur positif par retour d'état est calculé pour la première fois pour la régulation de la glycémie. Le plus grand ensemble positif invariant (EPI) est trouvé. Non seulement la positivité de la commande est révisée, mais plutôt un contrôle glycémique serré est atteint. Lorsque l'état initial du système appartient à l’EPI, l'hypoglycémie est évitée. Dans le cas contraire, l'hypoglycémie future est prédite pour tout état initial en dehors de l'EPIThis thesis investigates closed-loop control for glycemia regulation of Type1 Diabetes Mellitus (T1DM). Two main controller categories are designed: non-model-based and model-based. To test their efficiency, both types are tested in silico on two T1DM simulators. The first is a long-term model that is derived from clinical data of T1DM subjects and the second is the Uva/Padova simulator. Firstly, Model-free Control (MFC) is designed: a variable reference intelligent Proportional (iP) control and a constant reference intelligent Proportional-Integral-Derivative (iPID). Better overall performance is yielded with iPID over iP and over a classic PID. Secondly, a positive Sliding Mode Control SMC is designed for the first time for glycemia regulation. The model-based controller is chosen for glycemia regulation due to its well-known robustness properties. More importantly, our main contribution is that SMC is designed to be positive everywhere in the positively invariant set for the plasma insulin subsystem. Finally, a positive state feedback controller is designed for the first time to regulate glycemia. The largest Positively Invariant Set (PIS) is found. Not only control positivity is respected but rather a tight glycemic control is achieved. When the system initial condition belongs to the PIS, hypoglycemia is prevented, otherwise future hypoglycemia is predicted for any initial condition outside the PIS
49
Bailey, Nathaniel Karl. "Simulation and queueing network model formulation of mixed automated and non-automated traffic in urban settings." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/107069.
Full textAbstract:
Thesis: S.M. in Transportation, Massachusetts Institute of Technology, Department of Civil and Environmental Engineering, 2016.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 41-43).
Automated driving is an emerging technology in the automotive industry which will likely lead to significant changes in transportation systems. As automated driving technology is still in early stages of implementation in vehicles, it is important yet difficult to understand the nature of these changes. Previous research indicates that autonomous vehicles offer numerous benefits to highway traffic, but their impact on traffic in urban scenarios with mixed autonomous and non-autonomous traffic is less understood. This research addresses this issue by using microscopic traffic simulation to develop understanding of how traffic dynamics change as autonomous vehicle penetration rate varies. Manually driven and autonomous vehicles are modeled in a simulation environment with different behavioral models obtained from the literature. Mixed traffic is simulated in a simple network featuring traffic flowing through an isolated signalized intersection. The green phase length, autonomous vehicle penetration rate, and demand rate are varied. We observe an increase in network capacity and a decrease in average delay as autonomous vehicle penetration rate is increased. Using the results of the simulation experiments, an existing analytical network queueing model is formulated to model mixed autonomous and non-autonomous urban traffic. Results from the analytical model are compared to those from simulation in the small network and the Lausanne city network, and they are found to be consistent.
by Nathaniel Karl Bailey.
S.M. in Transportation
50
Danancher, Mickaël. "A discrete event approach for model-based location tracking of inhabitants in smart homes." Phd thesis, École normale supérieure de Cachan - ENS Cachan, 2013. http://tel.archives-ouvertes.fr/tel-00955543.
Full textAbstract:
Life expectancy has continuously increased in most countries over the last decades and will probably continue to increase in the future. This leads to new challenges relative to the autonomy and the independence of elderly. The development of Smart Homes is a direction to face these challenges and to enable people to live longer in a safe and comfortable environment. Making a home smart consists in placing sensors, actuators and a controller in the house in order to take into account the behavior of their inhabitants and to act on their environment to improve their safety, health and comfort. Most of these approaches are based on the real-time indoor Location Tracking of the inhabitants. In this thesis, a whole new approach for model-based Location Tracking of an a priori unknown number of inhabitants is proposed. This approach is based on Discrete Event Systems paradigms, theory and tools. The usage of Finite Automata (FA) to model the detectable motion of the inhabitants as well as different methods to create such FA models have been developed. Based on these models, algorithms to perform efficient Location Tracking are defined. Finally, several approaches aiming at evaluating the relevance of the instrumentation of a Smart Home with the objective of Location Tracking are proposed. The approach has also been fully implemented and tested. Throughout the thesis, the different contributions are illustrated on case studies.