Current electrical systems are faced with the limitation in performance by the electrical interconnect technology determining overall processing speed. In addition, the electrical interconnects containing many long distance interconnects require high power to drive. One of the best ways to overcome these bottlenecks is through the use of optical interconnect to limit interconnect latency and power. This research explores new computer-aided design algorithms for developing optoelectronic systems. These algorithms focus on place and route problems using optical interconnections covering system-on-a-chip design as well as system-on-a-package design. In order to design optoelectronic systems, optical interconnection models are developed at first. The CAD algorithms include optical interconnection models and solve place and route problems for optoelectronic systems. The MCNC and GSRC benchmark circuits are used to evaluate these algorithms.

Os recentes avanços na manufatura inteligente abrem oportunidades na área do suporte industrial, especificamente na manutenção e gestão de ativos físicos. Essa tendência permite que os dados coletados das máquinas, quando estão em pleno funcionamento, possam interagir com computadores, (ciberespaço), através de uma rede de comunicação formando assim o conceito de Sistemas Ciberfísicos (CPS – do inglês Cyber-Physical Systems). Além disso, os rápidos avanços da tecnologia de informação e comunicação proporcionam ferramentas para que essa interação possa analisar os dados, de forma cada vez mais rápida, autônoma, ubíqua e em tempo real, oferecendo informações que auxiliam aos humanos na tomada de decisões mais eficazes. Nesse contexto, o Prognóstico e Gestão da Saúde de máquinas (PHM – do inglês Prognostics Health and Management) é indicado como uma aplicação promissora da manufatura inteligente dentro do contexto de CPS. Atualmente as propostas de PHM encontradas na literatura cientifica são aplicadas a casos específicos e sem uma padronização da sua implementação, impedindo que tais abordagens possam ser replicadas em diferentes cenários da manufatura. Assim, o presente trabalho propõe a construção de um modelo ontológico para auxiliar na implementação do PHM em diversos cenários de manufatura, a ser aproveitada futuramente por ferramentas de softwares com foco em manufatura inteligente, padronizando seus conceitos, termos, e a forma de coleta e tratamento de dados. A abordagem metodológica DSR (do inglês Design Science Research) é usada para guiar o desenvolvimento da pesquisa. A construção deste modelo ontológico, que integra tanto os dados coletados quanto as informações necessárias para a tomada de decisões, possibilita o controle da estimativa de uma falha antes dela ocorrer de uma forma mais autônoma. Os principais resultados do modelo ontológico construído são: uma ontologia flexível capaz de ser usada em vários tipos de máquinas mecânicas de diversos tipos de manufatura; a possibilidade de armazenar o conhecimento contido em normas internacionais, históricos de atividades das máquinas, e arquiteturas consolidadas no contexto do PHM, permitindo a constante atualização de dados dependendo de particularidades que cada processo produtivo pode conter, e finalmente, usando a linguagem SPARQL entrega-se informações que podem ser usadas para tomada de decisões em intervenções oportunas de manutenção nos equipamentos de uma indústria real. O modelo é demonstrado considerando o caso de uma bomba centrífuga que comprovou sua fidelidade, integridade, nível de detalhe, robustez e consistência, fornecendo informações anteriormente alimentadas por dados reais obtidos em empresas próximas. / Recent advances in smart manufacturing open up opportunities in industrial support, specifically in maintenance and physical asset management. This trend allows data collected from machines, when are in full operation, to interact with cyberspace computers through a communication network, thus forming the concept of cyber-physical systems (CPS). Besides, rapid advances in information and communications technologies provide tools for analysing data, in an increasingly rapid, autonomously, ubiquitous and in real time way, providing information that assists humans in making better decisions. In this sense, Prognostics and Health Management (PHM) of machines, is indicated as a promising application of Smart Manufacturing in the CPS contexto. Currently the PHM proposals found in the scientific literature are applied to specific cases and without a standardization of their implementation, preventing such approaches from being replicated in different manufacturing scenarios. Thus, the present work proposes the construction of an ontological model to assist in the implementation of the PHM in several manufacturing scenarios, to be harnessed in the future by software tools focused on intelligent manufacturing, standardizing their concepts, terms, and the form of data collection and processing. The DSR (Design Science Research) methodological approach is used to guide the development of the research. The construction of this ontological model, which integrates both the collected data and the necessary information for the decision making, allows the control of the estimate of a failure before it occurs in a more autonomous way. The main results of the ontological model are: a flexible ontology capable of being used on several types of mechanical machines of various types of manufacturing; the possibility of storing the knowledge contained in international standards, machine history of activities, and consolidated architectures in the context of the PHM, allows the constant updating of data depending on particularities that each productive process can contain, and finally, using the SPARQL language, it is given information that can be used for decisionmaking in timely maintenance interventions in the equipment of a real industry. The model is demonstrated considering the case of a centrifugal pump that proved its fidelity, integrity, level of detail, robustness and consistency, providing information previously fed by real data obtained in nearby companies.

Os recentes avanços na manufatura inteligente abrem oportunidades na área do suporte industrial, especificamente na manutenção e gestão de ativos físicos. Essa tendência permite que os dados coletados das máquinas, quando estão em pleno funcionamento, possam interagir com computadores, (ciberespaço), através de uma rede de comunicação formando assim o conceito de Sistemas Ciberfísicos (CPS – do inglês Cyber-Physical Systems). Além disso, os rápidos avanços da tecnologia de informação e comunicação proporcionam ferramentas para que essa interação possa analisar os dados, de forma cada vez mais rápida, autônoma, ubíqua e em tempo real, oferecendo informações que auxiliam aos humanos na tomada de decisões mais eficazes. Nesse contexto, o Prognóstico e Gestão da Saúde de máquinas (PHM – do inglês Prognostics Health and Management) é indicado como uma aplicação promissora da manufatura inteligente dentro do contexto de CPS. Atualmente as propostas de PHM encontradas na literatura cientifica são aplicadas a casos específicos e sem uma padronização da sua implementação, impedindo que tais abordagens possam ser replicadas em diferentes cenários da manufatura. Assim, o presente trabalho propõe a construção de um modelo ontológico para auxiliar na implementação do PHM em diversos cenários de manufatura, a ser aproveitada futuramente por ferramentas de softwares com foco em manufatura inteligente, padronizando seus conceitos, termos, e a forma de coleta e tratamento de dados. A abordagem metodológica DSR (do inglês Design Science Research) é usada para guiar o desenvolvimento da pesquisa. A construção deste modelo ontológico, que integra tanto os dados coletados quanto as informações necessárias para a tomada de decisões, possibilita o controle da estimativa de uma falha antes dela ocorrer de uma forma mais autônoma. Os principais resultados do modelo ontológico construído são: uma ontologia flexível capaz de ser usada em vários tipos de máquinas mecânicas de diversos tipos de manufatura; a possibilidade de armazenar o conhecimento contido em normas internacionais, históricos de atividades das máquinas, e arquiteturas consolidadas no contexto do PHM, permitindo a constante atualização de dados dependendo de particularidades que cada processo produtivo pode conter, e finalmente, usando a linguagem SPARQL entrega-se informações que podem ser usadas para tomada de decisões em intervenções oportunas de manutenção nos equipamentos de uma indústria real. O modelo é demonstrado considerando o caso de uma bomba centrífuga que comprovou sua fidelidade, integridade, nível de detalhe, robustez e consistência, fornecendo informações anteriormente alimentadas por dados reais obtidos em empresas próximas. / Recent advances in smart manufacturing open up opportunities in industrial support, specifically in maintenance and physical asset management. This trend allows data collected from machines, when are in full operation, to interact with cyberspace computers through a communication network, thus forming the concept of cyber-physical systems (CPS). Besides, rapid advances in information and communications technologies provide tools for analysing data, in an increasingly rapid, autonomously, ubiquitous and in real time way, providing information that assists humans in making better decisions. In this sense, Prognostics and Health Management (PHM) of machines, is indicated as a promising application of Smart Manufacturing in the CPS contexto. Currently the PHM proposals found in the scientific literature are applied to specific cases and without a standardization of their implementation, preventing such approaches from being replicated in different manufacturing scenarios. Thus, the present work proposes the construction of an ontological model to assist in the implementation of the PHM in several manufacturing scenarios, to be harnessed in the future by software tools focused on intelligent manufacturing, standardizing their concepts, terms, and the form of data collection and processing. The DSR (Design Science Research) methodological approach is used to guide the development of the research. The construction of this ontological model, which integrates both the collected data and the necessary information for the decision making, allows the control of the estimate of a failure before it occurs in a more autonomous way. The main results of the ontological model are: a flexible ontology capable of being used on several types of mechanical machines of various types of manufacturing; the possibility of storing the knowledge contained in international standards, machine history of activities, and consolidated architectures in the context of the PHM, allows the constant updating of data depending on particularities that each productive process can contain, and finally, using the SPARQL language, it is given information that can be used for decisionmaking in timely maintenance interventions in the equipment of a real industry. The model is demonstrated considering the case of a centrifugal pump that proved its fidelity, integrity, level of detail, robustness and consistency, providing information previously fed by real data obtained in nearby companies.

Estimating program worst case execution time (WCET) is an important problem in the domain of real-time systems and embedded systems that are deadline-centric. If WCET of a program is found to exceed the deadline, it is either recoded or the target architecture is modified to meet the deadline. Predominantly, there exist three broad approaches to estimate WCET- static WCET analysis, hybrid measurement based analysis and statistical WCET analysis. Though measurement based analyzers benefit from knowledge of run-time behavior, amount of instrumentation remains a concern. This thesis proposes a CPI-centric WCET analyzer that estimates WCET as a product of worst case instruction count (IC) estimated using static analysis and worst case cycles per instruction (CPI) computed using a function of measured CPI. In many programs, it is observed that IC and CPI values are correlated. Five different kinds of correlation are found. This correlation enables us to optimize WCET from the product of worst case IC and worst case CPI to a product of worst case IC and corresponding CPI. A prime advantage of viewing time in terms of CPI, enables us to make use of program phase behavior. In many programs, CPI varies in phases during execution. Within each phase, the variation is homogeneous and lies within a few percent of the mean. Coefficient of variation of CPI across phases is much greater than within a phase. Using this observation, we estimate program WCET in terms of its phases. Due to the nature of variation of CPI within a phase in such programs, we can use a simple probabilistic inequality- Chebyshev inequality, to compute bounds of CPI within a desired probability. In some programs that execute many paths depending on if-conditions, CPI variation is observed to be high. The thesis proposes a PC signature that is a low cost way of profiling path information which is used to isolate points of high CPI variation and divides a phase into smaller sub-phases of lower CPI variation. Chebyshev inequality is applied to sub-phases resulting in much tighter bounds. Provision to divide a phase into smaller sub-phases based on allowable variance of CPI within a sub-phase also exists. The proposed technique is implemented on simulators and on a native platform. Other advantages of phases in the context of timing analysis are also presented that include parallelized WCET analysis and estimation of remaining worst case execution time for a particular program run.

Ces cinquante dernières annéees, les ordinateurs ont occupé une place toujours plus importante dans notre vie quotidienne. On les retrouve aujourd’hui présents dans de nombreuses applications, sous forme de systèmes enfouis. Ces applications sont parfois critiques, dans la mesure où toute défaillance du système informatique peut avoir des conséquences catastrophiques, tant sur le plan humain que sur le plan économique. <p>Nous pensons par exemple aux systèmes informatiques qui contrôlent les appareils médicaux ou certains systèmes vitaux (comme les freins) des véhicules automobiles. <p>Afin d’assurer la correction de ces systèmes informatiques, différentes techniques de vérification Assistée par Ordinateur ont été proposées, durant les trois dernières <p>décennies principalement. Ces techniques reposent sur un principe commun: donner une description formelle tant du système que de la propriété qu’il doit respecter, et appliquer une méthode automatique pour prouver que le système respecte la propriété. <p>Parmi les principaux modèles aptes à décrire formellement des systèmes informatiques, la classe des systèmes de transition bien structurés [ACJT96, FS01] occupe une place importante, et ce, pour deux raisons essentielles. Tout d’abord, cette classe généralise plusieurs autres classes bien étudiées et utiles de modèles à espace <p>d’états infini, comme les réseaux de Petri [Pet62](et leurs extensions monotones [Cia94, FGRVB06]) ou les systèmes communiquant par canaux FIFO avec pertes [AJ93]. Ensuite, des problèmes intéressants peuvent être résolus algorithmiquement sur cette classe. Parmi ces problèmes, on trouve le probléme de couverture, auquel certaines propriétés intéressantes de sûreté peuvent être réduites. <p>Dans la première partie de cette thèse, nous nous intéressons au problème de couverture. Jusqu’à présent, le seul algorithme général (c’est-à-dire applicable à n’importe quel système bien structuré) pour résoudre ce problème était un algorithme dit en arrière [ACJT96] car il calcule itérativement tous les états potentiellement non-sûrs et vérifie si l’état initial du système en fait partie. Nous proposons Expand, Enlarge and Check, le premier algorithme en avant pour résoudre le problème de couverture, qui calcule les états potentiellement accessibles du système et vérifie si certains d’entre eux sont non-sûrs. Cette approche est plus efficace en pratique, comme le montrent nos expériences. Nous présentons également des techniques permettant d’accroître l’efficacité de notre méthode dans le cas où nous analysons des réseaux de Petri (ou <p>une de leurs extensions monotones), ou bien des systèmes communiquant par canaux FIFO avec pertes. Enfin, nous nous intéressons au calcul de l’ensemble de couverture pour les réseaux de Petri, un objet mathématique permettant notamment de résoudre le problème de couverture. Nous étudions l’algorithme de Karp & Miller [KM69], une solution classique pour calculer cet ensemble. Nous montrons qu’une optimisation de cet algorithme présenté dans [Fin91] est fausse, et nous proposons une autre solution totalement neuve, et plus efficace que la solution de Karp & Miller. <p>Dans la seconde partie de la thèse, nous nous intéressons aux pouvoirs d’expression des systèmes bien structurés, tant en terme de mots infinis que de mots finis. Le pouvoir d’expression d’une classe de systèmes est, en quelque sorte, une mesure de la diversité des comportements que les modèles de cette classe peuvent représenter. En ce qui concerne les mots infinis, nous étudions les pouvoirs d’expression des réseaux de Petri et de deux de leurs extensions (les réseaux de Petri avec arcs non-bloquants et les réseaux de Petri avec arcs de transfert). Nous montrons qu’il existe une hiérarchie stricte entre ces différents pouvoirs d’expression. Nous obtenons également des résultats partiels concernant le pouvoir d’expression des réseaux de Petri avec arcs de réinitialisation. En ce qui concerne les mots finis, nous introduisons la classe des langages bien structurés, qui sont des langages acceptés par des systèmes de transition bien structurés étiquettés, où l’ensemble des états accepteurs est clos par le haut. Nous prouvons trois lemmes de pompage concernant ces langages. Ceux-ci nous permettent de réobtenir facilement des résultats classiques de la littérature, ainsi que plusieurs nouveaux résultats. En particulier, nous prouvons, comme dans le cas des mots infinis, qu’il existe une hiérarchie stricte entre les pouvoirs d’expression des extensions des réseaux de Petri considérées. / Doctorat en sciences, Spécialisation Informatique / info:eu-repo/semantics/nonPublished

<p align="justify">Computer Science is currently facing a grand challenge :finding good design practices for embedded systems. Embedded systems are essentially computers interacting with some physical process. You could find one in a braking systems or in a nuclear power plant for example. They present several design difficulties :first they are reactive systems, interacting indefinitely with their environment. Second,they must satisfy real-time constraints specifying when they should respond, and not only how. Finally, their environment is often deeply continuous, presenting complex dynamics. The formal models of choice for specifying such systems are timed and hybrid automata for which model checking is pretty well studied.</p> <p><p align="justify">In a first part of this thesis, we study a complete design approach, including verification and code generation, for timed automata. We have to define a new semantics for timed automata, the AASAP semantics, that preserves the decidability properties for model checking and at the same time is implementable. Our notion of implementability is completely novel, and relies on the simulation of a semantics that is obviously implementable on a real platform. We wrote tools for the analysis and code generation and exemplify them on a case study about the well known Philips Audio Control Protocol.</p> <p><p align="justify">In a second part of this thesis, we study the problem of controller synthesis for an environment specified as a hybrid automaton. We give a new solution for discrete controllers having only an imperfect information about the state of the system. In the process, we defined a new algorithm, based on the monotonicity of the controllable predecessors operator, for efficiently finding a controller and we show some promising applications on a classical problem :the universality test for finite automata. / Doctorat en sciences, Spécialisation Informatique / info:eu-repo/semantics/nonPublished

Indiana University-Purdue University Indianapolis (IUPUI) / Asynchronous JavaScript and XML (AJAX) is the primary method for enabling asynchronous communication over the Web. Although AJAX is providing warranted real-time capabilities to the Web, it requires unconventional programming methods at the expense of extensive resource usage. WebSockets, which is an emerging protocol, has the potential to address many challenges with implementing asynchronous communication over the Web. There, however, has been no in-depth study that quantitatively compares AJAX and WebSockets. This thesis therefore provides two contributions to Web development. First, it provides an experience report for adding real-time monitoring support over the Web to the Open-source Architecture of Software Instrumentation of Systems(OASIS), which is open-source real-time instrumentation middleware for distributed real-time and embedded (DRE) systems. Secondly, it quantitatively compares using AJAX and WebSockets to stream collected instrumentation data over the Web in real-time. Results from quantitative comparison between WebSockets and AJAX show that a WebSockets server consumes 50% less network bandwidth than an AJAX server; a WebSockets client consumes memory at constant rate, not at an increasing rate; and WebSockets can send up to 215.44% more data samples when consuming the same amount network bandwidth as AJAX.

Indiana University-Purdue University Indianapolis (IUPUI) / Blömmer, Otto, and Seifert presented a fault attack on elliptic curve scalar multiplication called the Sign Change Attack, which causes a fault that changes the sign of the accumulation point. As the use of a sign bit for an extended integer is highly unlikely, this appears to be a highly selective manipulation of the key stream. In this thesis we describe two plausible fault attacks on a smart card implementation of elliptic curve cryptography. King and Wang designed a new attack called counter fault attack by attacking the scalar multiple of discrete-log cryptosystem. They then successfully generalize this approach to a family of attacks. By implementing King and Wang's scheme on RSA, we successfully attacked RSA keys for a variety of sizes. Further, we generalized the attack model to an attack on any implementation that uses NAF and wNAF key.