Spelling suggestions: "subject:"automata™""
21 |
Optimized diagnosability of distributed discrete event systems through abstractionYe, Lina 07 July 2011 (has links) (PDF)
Depuis plusieurs années, de nombreuses recherches ont été menées autour du diagnostic. Cependant, il est impératif de se préoccuper dès la phase de conception d'un système des objectifs de diagnostic à atteindre. Aussi, de nombreux travaux se sont intéressés à analyser et à caractériser les propriétés de la diagnosticabilité d'un système. La diagnosticabilité est la propriété d'un système garantissant qu'il génère des observations permettant de détecter et discriminer les fautes en temps fini après leur occurrence.Le sujet de cette thèse porte sur les méthodes permettant d'établir les propriétés de la diagnosticabilité des systèmes à événements discrets dans le cadre distribué, sans construction du modèle global du système. Ce cadre est de première importance pour les applications réelles : systèmes naturellement distribués, systèmes trop complexes pour traiter leur modèle global, confidentialité des modèles locaux les uns par rapport aux autres. L'analyse de la diagnosticabilité de tels systèmes distribués se fonde sur des opérations de synchronisation des modèles locaux, par les observations et les communications. D'abord, nous étudions comment optimiser cette analyse de la diagnosticabilité en faisant abstraction de l'information nécessaire et suffisante à partir des objets locaux pour décider la diagnosticabilité globale. L'efficacité de l'algorithme peut être grandement améliorée par la synchronisation des objets locaux et abstraits en comparaison avec celle des objets locaux et non abstraits.Ensuite, nous proposons, dans le cadre distribué, l'algorithme de la diagnosticabilité de motifs d'événements particuliers a priori inobservables dans les systèmes. Ces motifs peuvent être simplement l'occurrence, brutale ou graduelle, d'une faute permanente ou transitoire, plusieurs occurrences d'une faute, plusieurs fautes en cascade, etc. Dans le cadre distribué, la reconnaissance du motif d'événements s'effectue d'abord progressivement dans un sous-système et ensuite la diagnosticabilité de ce motif peut être déterminée par la méthode abstraite et distribuée. Nous prouvons la correction et l'efficacité de notre algorithme à la fois en théorie et en pratique par la mise en œuvre de l'implémentation sur des exemples.Finalement, nous étudions le problème de la diagnosticabilité dans les systèmes distribués avec composants autonomes, où l'information observable est distribuée au lieu d'être centralisée comme jusqu'alors. En d'autres termes, chaque composant ne peut appréhender que ses propres événements observables. Nous donnons la définition de la diagnosticabilité conjointe. Et puis nous discutons de l'indécidabilité de diagnosticabilité conjointe dans le cas général, c'est à dire, les événements de communication ne sont pas observables, avant de proposer un algorithme pour tester sa condition suffisante. De plus, nous obtenons également un résultat de décidabilité et de l'algorithme lorsque les communications sont observables.
|
22 |
A Novel Approach for Performance Assessment of Human-Robotic InteractionAbou Saleh, Jamil 16 March 2012 (has links)
Robots have always been touted as powerful tools that could be used effectively in a number of applications ranging from automation to human-robot interaction. In order for such systems to operate adequately and safely in the real world, they must be able to perceive, and must have abilities of reasoning up to a certain level. Toward this end, performance evaluation metrics are used as important measures. This research work is intended to be a further step toward identifying common metrics for task-oriented human-robot interaction. We believe that within the context of human-robot interaction systems, both humans' and robots' actions and interactions (jointly and independently) can significantly affect the quality of the accomplished task. As such, our goal becomes that of providing a foundation upon which we can assess how well the human and the robot perform as a team. Thus, we propose a generic performance metric to assess the performance of the human-robot team, where one or more robots are involved. Sequential and parallel robot cooperation schemes with varying levels of task dependency are considered, and the proposed performance metric is augmented and extended to accommodate such scenarios. This is supported by some intuitively derived mathematical models and some advanced numerical simulations. To efficiently model such a metric, we propose a two-level fuzzy temporal model to evaluate and estimate the human trust in automation, while collaborating and interacting with robots and machines to complete some tasks. Trust modelling is critical, as it directly influences the interaction time that should be directly and indirectly dedicated toward interacting with the robot. Another fuzzy temporal model is also presented to evaluate the human reliability during interaction time. A significant amount of research work stipulates that system failures are due almost equally to humans as to machines, and therefore, assessing this factor in human-robot interaction systems is crucial. The proposed framework is based on the most recent research work in the areas of human-machine interaction and performance evaluation metrics. The fuzzy knowledge bases are further updated by implementing an application robotic platform where robots and users interact via semi-natural language to achieve tasks with varying levels of complexity and completion rates. User feedback is recorded and used to tune the knowledge base where needed. This work intends to serve as a foundation for further quantitative research to evaluate the performance of the human-robot teams in achievement of collective tasks.
|
23 |
Voronoi diagramų braižymas ląsteliniu automatu / Voronoi diagrams drawing with cellular automatonVosylius, Audrius 06 June 2005 (has links)
In this work Voronoi diagrams which are drawn by the cellular automaton are discussed. The square and hexagon cellular automata were created and used for drawing Voronoi diagrams. As a result of using the created programs Voronoi diagrams, which are obtained in case of two and more dots, are observed. The following results of the research were achieved: § Voronoi diagram can be obtained by the cellular automaton. § Voronoi diagrams, which were obtained, are not precise due to different speed of movement in different directions. § In square - cell case the obtained diagrams depend on the chosen situation of the neighbors. § In hexagon - cell case the obtained Voronoi diagrams are more but not completely precise. The mathematic calculations are not being made while creating Voronoi diagrams by the cellular automaton.. The diagrams are obtained in short period of time. It is possible to watch the process of the diagram creation. A lot of computer's operation time is lost not during the calculation but for re-drawing the obtained image. This is the reason why it is necessary to optimize the image creating algorithm.
|
24 |
A Novel Approach for Performance Assessment of Human-Robotic InteractionAbou Saleh, Jamil 16 March 2012 (has links)
Robots have always been touted as powerful tools that could be used effectively in a number of applications ranging from automation to human-robot interaction. In order for such systems to operate adequately and safely in the real world, they must be able to perceive, and must have abilities of reasoning up to a certain level. Toward this end, performance evaluation metrics are used as important measures. This research work is intended to be a further step toward identifying common metrics for task-oriented human-robot interaction. We believe that within the context of human-robot interaction systems, both humans' and robots' actions and interactions (jointly and independently) can significantly affect the quality of the accomplished task. As such, our goal becomes that of providing a foundation upon which we can assess how well the human and the robot perform as a team. Thus, we propose a generic performance metric to assess the performance of the human-robot team, where one or more robots are involved. Sequential and parallel robot cooperation schemes with varying levels of task dependency are considered, and the proposed performance metric is augmented and extended to accommodate such scenarios. This is supported by some intuitively derived mathematical models and some advanced numerical simulations. To efficiently model such a metric, we propose a two-level fuzzy temporal model to evaluate and estimate the human trust in automation, while collaborating and interacting with robots and machines to complete some tasks. Trust modelling is critical, as it directly influences the interaction time that should be directly and indirectly dedicated toward interacting with the robot. Another fuzzy temporal model is also presented to evaluate the human reliability during interaction time. A significant amount of research work stipulates that system failures are due almost equally to humans as to machines, and therefore, assessing this factor in human-robot interaction systems is crucial. The proposed framework is based on the most recent research work in the areas of human-machine interaction and performance evaluation metrics. The fuzzy knowledge bases are further updated by implementing an application robotic platform where robots and users interact via semi-natural language to achieve tasks with varying levels of complexity and completion rates. User feedback is recorded and used to tune the knowledge base where needed. This work intends to serve as a foundation for further quantitative research to evaluate the performance of the human-robot teams in achievement of collective tasks.
|
25 |
Minimalizace automatů s jednoduchými čítači / Minimization of Counting AutomataTurcel, Matej January 2021 (has links)
Táto práca sa zaoberá redukciou veľkosti tzv. čítačových automatov. Čítačové automaty rozširujú klasické konečné automaty o čítače s obmedzeným rozsahom hodnôt. Umožňujú tým efektívne spracovať napr. regulárne výrazy s opakovaním: a{5,10}. V tejto práci sa zaoberáme reláciou simulácie v čítačových automatoch, pomocou ktorej sme schopní zredukovať ich veľkosť. Opierame sa pritom o klasickú simuláciu v konečných automatoch, ktorú netriviálnym spôsobom rozširujeme na čítačové automaty. Kľúčovým rozdielom je nutnosť simulovať okrem stavov taktiež čítače. Za týmto účelom zavádzame nový koncept parametrizovanej relácie simulácie, a navrhujeme metódy výpočtu tejto relácie a redukcie veľkosti čítačových automatov pomocou nej. Navrhnuté metódy sú tiež implementované a je vyhodnotená ich efektivita.
|
26 |
Minimalizace automatů s jednoduchými čítači / Minimization of Counting AutomataTurcel, Matej January 2021 (has links)
Táto práca sa zaoberá redukciou veľkosti tzv. čítačových automatov. Čítačové automaty rozširujú klasické konečné automaty o čítače s obmedzeným rozsahom hodnôt. Umožňujú tým efektívne spracovať napr. regulárne výrazy s opakovaním: a{5,10}. V tejto práci sa zaoberáme reláciou simulácie v čítačových automatoch, pomocou ktorej sme schopní zredukovať ich veľkosť. Opierame sa pritom o klasickú simuláciu v konečných automatoch, ktorú netriviálnym spôsobom rozširujeme na čítačové automaty. Kľúčovým rozdielom je nutnosť simulovať okrem stavov taktiež čítače. Za týmto účelom zavádzame nový koncept parametrizovanej relácie simulácie, a navrhujeme metódy výpočtu tejto relácie a redukcie veľkosti čítačových automatov pomocou nej. Navrhnuté metódy sú tiež implementované a je vyhodnotená ich efektivita.
|
27 |
Modeling of dendrite growth with cellular automaton method in the solidification of alloysYin, Hebi 07 August 2010 (has links)
Dendrite growth is the primary form of crystal growth observed in laser deposition process of most commercial metallic alloys. The properties of metallic alloys strongly depend on their microstructure; that is the shape, size, orientation and composition of the dendrite matrix formed during solidification. Understanding and controlling the dendrite growth is vital in order to predict and achieve the desired microstructure and hence properties of the laser deposition metals. A two dimensional (2D) model combining the finite element method (FE) and the cellular automaton technique (CA) was developed to simulate the dendrite growth both for cubic and for hexagonal close-packed (HCP) crystal structure material. The application of this model to dendrite growth occurring in the molten pool during the Laser Engineered Net Shaping (LENS®) process was discussed. Based on the simulation results and the previously published experimental data, the expressions describing the relationship between the cooling rate and the dendrite arm spacing (DAS), were proposed. In addition, the influence of LENS process parameters, such as the moving speed of the laser beam and the layer thickness, on the DAS was also discussed. Different dendrite morphologies calculated at different locations were explained based on local solidification conditions. And the influence of convection on dendrite growth was discussed. The simulation results showed a good agreement with previously published experiments. This work contributes to the understanding of microstructure formation and resulting mechanical properties of LENS-built parts as well as provides a fundamental basis for optimization of the LENS process.
|
28 |
Problèmes de bornes pour les automates et les transducteurs à pile visible / Boudedness problems for visibly pushdown automata and transducersCaralp, Mathieu 18 December 2015 (has links)
L’étude des automates est un sujet fondamental de l’informatique. Ce modèle apporte des solutions pratiques à divers problèmes en compilation et en vérification notamment. Dans ce travail nous proposons l'extension aux automates à pile visible de résultats existants pour les automates. Nous proposons une définition d'automate à pile visible émondé et donnons un algorithme s’exécutant en temps polynomial émondant un automate en préservant son langage. Nous donnons aussi un algorithme de complexité exponentielle qui, pour un automate à pile visible donné, construit un automate équivalent à la fois émondé et déterministe. Cette complexité exponentielle se révèle optimale. Étant donné un automate à pile visible, nous pouvons associer à ses transitions des coûts pris dans un semi-anneau S. L’automate associe ainsi un mot d’entrée à un élément de S. Le coût d’un automate est le supremum des coûts associés aux mots d'entrée. Pour les semi-anneaux des entiers naturels et Max-plus, nous donnons des caractérisations et des algorithmes polynomiaux pour décider si le coût d’un automate est fini. Puis, nous étudions pour les entiers naturels la complexité du problème de la majoration du coût par un entier k. Les transducteurs à pile visibles produisent des sorties sur chaque mot accepté. Un problème classique est de décider s'il existe une borne sur le nombre de sorties de chaque mot accepté. Pour une sous-classe des transducteurs à pile visible, nous proposons des propriétés caractérisant les instances positives de ce problème. Nous montrons leur nécessité et discutons d’approches possibles afin de montrer leur suffisance. / The study of automata is a central subject of computer science. This model provides practical solutions to several problems including compilation and verification. In this work we extend existing results of automata to visibly pushdown automata. We give a definition of trimmed visibly pushdown automata and a polynomial time algorithm to trim an automata while preserving its language. We also provide an exponential time algorithm which, given a visibly pushdown automaton, produces an equivalent automaton, both deterministic and trimmed. We prove the optimality of the complexity. Given a visibly pushdown automaton, we can equip its transitions with a cost taken from a semiring S, and thus associate each input word to an element of S. The cost of the automaton is the supremum of the input words cost. For the semiring of natural integers and Max-plus, we give characterisations and polynomial time algorithms to decide if the cost of a visibly pushdown automaton is finite. Then in the case of natural integers we study the complexity of deciding if the cost is bounded by a given integer k. Visibly pushdown transducers produce output on each accepted word. A classical problem is to decide if there exists a bound on the number of outputs of each accepted word. In the case of a subclass of visibly pushdown transducers, we give properties characterizing positive instances of this problem. We show their necessity and discuss of possible approaches to prove their sufficiency.
|
29 |
Autômatos celulares não-uniformes, com conexões não-locais, na classificação de densidadeFaria, Fernando 11 March 2008 (has links)
Made available in DSpace on 2016-03-15T19:38:09Z (GMT). No. of bitstreams: 1
Fernando Faria.pdf: 516281 bytes, checksum: fc784946b9c2438b3c18c34593a182cb (MD5)
Previous issue date: 2008-03-11 / Wolfram Research, Inc. / Cellular automata are discrete dynamical systems composed of simple, locally connected structures (the cells), general in terms of their computational power, and that display complex patterns of behaviour. The purpose of this work was to expand previous studies by Zanon (2006), on non-uniform, one-dimensional cellular automata with nonlocal neighbourhood, in order to verify the existence of rules of these kinds of automata to solve the density classification task, that is, the determination of the predominant bit in a
binary string. Our concern here was to look for solutions of the problem mainly by evolutionary computation means, to solve it in a non-trivial fashion, i.e., without including in the solution the majority rule over the entire lattice, and, at the same time, with the target of inferring common features for the solutions that would be found. The results achieved led to an expansion in the quantity of perfect solutions available in the literature, but it became clear that all of them have at least one of the rules involved able to account for the entire lattice at once, an evidence that solutions without rules with global action may not exist. Furthermore, the following observations have been made for the type of automata we
considered: even distinct automata may have the same temporal evolution; a certain degree of flexibility is allowed in the total balancing of the rules present in a solution of the
density classification task; and, in principle, no common patterns seem to exist between solutions for lattices with 3 and 5 cells, thereby suggesting the impossibility of constructing a solution to the problem from another of a smaller lattice. / Autômatos celulares são sistemas dinâmicos discretos, formados por estruturas simples (as células) conectadas localmente entre si, gerais em termos de seu poder computacional, e que apresentam padrões de comportamento bastante complexos. O intuito deste trabalho foi expandir estudos anteriores de Zanon (2006), sobre autômatos celulares unidimensionais não-uniformes, com vizinhança não-local, visando verificar a existência de autômatos desse tipo na resolução da tarefa da classificação de densidade, isto é, a
determinação do bit predominante em uma cadeia binária. Interessou-nos aqui descobrir soluções do problema principalmente por meio de buscas evolutivas, resolvê-lo de forma não trivial, isto é, sem a necessidade da regra da maioria sobre todo o reticulado, e objetivando inferir características necessárias para as soluções que viessem a resolver o problema. Os resultados obtidos levaram a uma expansão da quantidade de soluções perfeitas reportadas na literatura, mas observou-se que todas elas contém pelo menos uma das regras envolvidas tomando todo o reticulado como base de ação, uma evidência da impossibilidade de existir soluções sem regras individuais de ação global. Adicionalmente, as seguintes constatações foram feitas para os autômatos celulares do tipo considerado: mesmo autômatos distintos entre si podem ter a mesma evolução temporal; uma flexibilização do balanceamento total das regras na solução do problema da classificação de densidade é conseguida; e, em princípio, não há padrões nas soluções perfeitas para reticulados de 3 e 5 células, sugerindo a impossibilidade de se construir uma solução a partir de outra de menor tamanho de reticulado.
|
30 |
Syntaktická analýza založená na párových automatech / Syntactic Analysis Based on Coupled Finite AutomataZámečníková, Eva Unknown Date (has links)
Master's thesis is dealing with translation based on coupled finite automaton model. Coupled finite automaton contains input and output automaton. The input automaton makes syntactic analysis with an input string. Used rules from the input automaton control the output automaton, which generates an output string. In thesis is described a way of determinisation of the input automaton without loss of information about rules used in original automaton. The determinizitaion is divided into two parts - for finite and infinite translation specified by transducers. Then is presented a new pair automaton with increased computing power. This increased computing power consists in replace of input or output or just a part of automaton by context free grammar.
|
Page generated in 0.0538 seconds