Готові списки джерел за темами / Machines de Mealy

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Machines de Mealy"

Автор: Grafiati

Опубліковано: 1 жовтня 2022

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Machines de Mealy".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Machines de Mealy"

Mordeson, J. N., and P. S. Nair. "Fuzzy Mealy machines." Kybernetes 25, no. 3 (April 1996): 18–33. http://dx.doi.org/10.1108/03684929610116392.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Amato, Christopher, Blai Bonet, and Shlomo Zilberstein. "Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (July 4, 2010): 1052–58. http://dx.doi.org/10.1609/aaai.v24i1.7748.

Повний текст джерела

Анотація:

Existing controller-based approaches for centralized and decentralized POMDPs are based on automata with output known as Moore machines. In this paper, we show that several advantages can be gained by utilizing another type of automata, the Mealy machine. Mealy machines are more powerful than Moore machines, provide a richer structure that can be exploited by solution methods, and can be easily incorporated into current controller-based approaches. To demonstrate this, we adapted some existing controller-based algorithms to use Mealy machines and obtained results on a set of benchmark domains. The Mealy-based approach always outperformed the Moore-based approach and often outperformed the state-of-the-art algorithms for both centralized and decentralized POMDPs. These findings provide fresh and general insights for the improvement of existing algorithms and the development of new ones.

Стилі APA, Harvard, Vancouver, ISO та ін.

Tiňo, Peter, and Jozef Šajda. "Learning and Extracting Initial Mealy Automata with a Modular Neural Network Model." Neural Computation 7, no. 4 (July 1995): 822–44. http://dx.doi.org/10.1162/neco.1995.7.4.822.

Повний текст джерела

Анотація:

A hybrid recurrent neural network is shown to learn small initial mealy machines (that can be thought of as translation machines translating input strings to corresponding output strings, as opposed to recognition automata that classify strings as either grammatical or nongrammatical) from positive training samples. A well-trained neural net is then presented once again with the training set and a Kohonen self-organizing map with the “star” topology of neurons is used to quantize recurrent network state space into distinct regions representing corresponding states of a mealy machine being learned. This enables us to extract the learned mealy machine from the trained recurrent network. One neural network (Kohonen self-organizing map) is used to extract meaningful information from another network (recurrent neural network).

Стилі APA, Harvard, Vancouver, ISO та ін.

MORDESON, J. N., and P. S. NAIR. "FUZZY MEALY MACHINES: HOMOMORPHISMS, ADMISSIBLE RELATIONS AND MINIMAL MACHINES." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 04, no. 01 (February 1996): 27–43. http://dx.doi.org/10.1142/s0218488596000032.

Повний текст джерела

Анотація:

Homomorphisms and admissible relations of fuzzy Mealy machines are studied. Admissible relations play a role similar to normal subgroups in group theory. The kernel of a homomorphism is shown to be an admissible relation. Conversely, corresponding to an admissible relation, there exists a homomorphism. The fundamental theorem on homomorphisms; and the existence and uniqueness of minimal machines are also presented.

Стилі APA, Harvard, Vancouver, ISO та ін.

Bukowiec, Arkadiusz, and Luis Gomes. "Partitioning of Mealy Finite State Machines." IFAC Proceedings Volumes 42, no. 21 (2009): 19–24. http://dx.doi.org/10.3182/20091006-3-es-4010.00006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

A.Morye, S., and S. R. Chaudhari. "On Properties of Fuzzy Mealy Machines." International Journal of Computer Applications 63, no. 19 (February 15, 2013): 1–8. http://dx.doi.org/10.5120/10571-5615.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hansen, Helle Hvid, David Costa, and Jan Rutten. "Synthesis of Mealy Machines Using Derivatives." Electronic Notes in Theoretical Computer Science 164, no. 1 (October 2006): 27–45. http://dx.doi.org/10.1016/j.entcs.2006.06.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Jim, Kam-Chuen, and C. Lee Giles. "Talking Helps: Evolving Communicating Agents for the Predator-Prey Pursuit Problem." Artificial Life 6, no. 3 (July 2000): 237–54. http://dx.doi.org/10.1162/106454600568861.

Повний текст джерела

Анотація:

We analyze a general model of multi-agent communication in which all agents communicate simultaneously to a message board. A genetic algorithm is used to evolve multi-agent languages for the predator agents in a version of the predator-prey pursuit problem. We show that the resulting behavior of the communicating multi-agent system is equivalent to that of a Mealy finite state machine whose states are determined by the agents' usage of the evolved language. Simulations show that the evolution of a communication language improves the performance of the predators. Increasing the language size (and thus increasing the number of possible states in the Mealy machine) improves the performance even further. Furthermore, the evolved communicating predators perform significantly better than all previous work on similar prey. We introduce a method for incrementally increasing the language size, which results in an effective coarse-to-fine search that significantly reduces the evolution time required to find a solution. We present some observations on the effects of language size, experimental setup, and prey difficulty on the evolved Mealy machines. In particular, we observe that the start state is often revisited, and incrementally increasing the language size results in smaller Mealy machines. Finally, a simple rule is derived that provides a pessimistic estimate on the minimum language size that should be used for any multi-agent problem.

Стилі APA, Harvard, Vancouver, ISO та ін.

Chibnik, Mara. "Algorithmic elimination of spurious nondeterminism from Mealy machines." ACM SIGACT News 17, no. 3 (January 1986): 30–34. http://dx.doi.org/10.1145/382254.382804.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liu, Jun, Zhi-wen Mo, Dong Qiu, and Yang Wang. "Products of Mealy-type fuzzy finite state machines." Fuzzy Sets and Systems 160, no. 16 (August 2009): 2401–15. http://dx.doi.org/10.1016/j.fss.2009.01.001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Machines de Mealy"

Godin, Thibault. "Machines de Mealy, (semi-)groupes d'automate, problèmes de décision et génération aléatoire." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCC172/document.

Повний текст джерела

Анотація:

Dans cette thèse, on se propose d'étudier les automates de Mealy, c'est-à-dire des transducteurs complets déterministes lettre à lettre ayant même alphabet d'entrée et de sortie. Ces automates sont utilisés depuis les années 60 pour engendrer des (semi-)groupes qui ont parfois des propriétés remarquables, permettant ainsi de résoudre plusieurs problèmes ouverts en théorie des (semi-)groupes. Dans ce travail, on s’intéresse plus particulièrement aux apports possibles de l'informatique théorique à l'étude de ces (semi-)groupes engendrés par automate. La thèse présentée s'articule autours de deux grands axes. Le premier, qui correspond aux chapitres II et III, traite des problèmes de décision et plus spécifiquement du problème de Burnside dans le chapitre II et des points singuliers dans le chapitre III. Dans ces deux chapitres on met en lien des propriétés structurelles de l'automate avec des propriétés du groupe engendré ou de son action. Le second axe, représenté par le chapitre IV, se rapporte à la génération aléatoire de groupes finis. On cherche, en tirant des automates de Mealy aléatoirement dans des classes spécifiques, à engendrer des groupes finis, et on aboutit à un résultat de convergence pour la distribution ainsi obtenue. Ce résultat fait écho au théorème de Dixon pour les groupes de permutations aléatoires
In this thesis, we study Mealy automata, i.e. complete, deterministic, letter-to-letter transducers which have same input and output alphabet. These automata have been used since the 60s to generate (semi)groups that sometimes have remarkable properties, that were used to solve several open problems in (semi)group theory. In this work, we focus more specifically on the possible contributions that theoretical computer science can bring to the study of these automaton (semi)groups.The thesis consists of two main axis. The first one, which corresponds to the Chapters II and III, deals with decision problems and more precisely with the Burnside problem in Chapter II and with singular points in Chapter III. In these two chapters, we link structural properties of the automaton with properties of the generated group or of its action. The second axis, which comprises the Chapter IV, is related with random generation of finite groups. We seek, by drawing random Mealy automata in specific classes, to generate finite groups, and obtain a convergence result for the obtained distribution. This result echoes Dixon's theorem on random permutation groups

Стилі APA, Harvard, Vancouver, ISO та ін.

Potop-Butucaru, Dumitru. "Optimisations pour la simulation efficace de programmes Esterel." Paris, ENMP, 2002. http://www.theses.fr/2002ENMP0002.

Повний текст джерела

Анотація:

Esterel est un langage de spécification utilisé dans le développement de systèmes embarqués. Sa sémantique formelle permet des traductions en automates explicites ou en circuits digitaux synchrones, donnant lieu à deux implantations logicielles dont les propriétés essentielles sont héritées du modèle correspondant. Ces méthodes de compilation sont donc sémantiquement complètes, mais en contrepartie n’arrivent pas à générer du code efficace (à la fois compact et rapide) pour des modèles de taille conséquente. Pour cette raison, de nouvelles techniques ont été proposées récemment pour la génération de code C efficace, consistant essentiellement dans la simulation directe des opérations réactives du programme Esterel. Ces nouvelles techniques doivent être conciliées maintenant avec les aspects spécifiques à la sémantique d’Esterel qui sont la causalité constructive et la cyclicité. Elles doivent aussi être munies de techniques adaptées d’analyse et d’optimisation. Pour atteindre ces objectifs, nous proposons une nouvelle technique de compilation dont la puissance découle de l’utilisation d’un nouveau format intermédiaire, nommé GRC. La représentation GRC d’un programme Esterel se compose d’une représentation de l’état hiérarchique du programme et d’un graphe déstructuré de flot de contrôle. Les deux composants, séparés au niveau syntaxique, sont sémantiquement interdépendants. Le nouveau format permet la représentation de tout programme Esterel. Il est un bon support pour des algorithmes d’optimisation efficaces à ce niveau et pour des algorithmes d’implantation (ordonnancement et encodage) efficaces. Notre travail apporte les contributions suivantes : - une définition précise de la sémantique du langage Esterel avec données ; - la définition du format GRC et de la correspondance formelle entre le code GRC et les circuits générés à partir d’Esterel ; - la caractérisation, au niveau du code GRC, de la classe de programmes Esterel générant des circuits cycliques ; - le développement d’un compilateur Esterel-C qui utilise GRC comme unique format intermédiaire. Le prototype traite actuellement les programmes Esterel dont la représentation GRC est acyclique. Le code C est obtenu dans ces cas par une planification statique du graphe de flot de contrôle GRC. Le compilateur implémente un bon nombre de techniques d’optimisation, en partie originales. Une comparaison entre notre prototype et les autres compilateurs montre l’intérêt de l’approche
Esterel is a design language for reactive embedded systems. It enjoys a full-fledged formal operational semantics, and can customarily be compiled into either explicit Finite State Machines or Digital Sequential Circuit models, thereby providing implementation codes with very distinctive flavors. While being semantically complete, the model-based techniques do not support the generation of efficient (fast and small) code for large specifications. For this reason, new compilation schemes were proposed for the generation of efficient sequential ( C) code. Consisting essentially in direct actual simulation of the language reactive features, the new approach now needs to be accommodated with similar semantic issues as the previous ones (FSM- and circuit-based). Such issues include dealing with the whole class of constructively causal programs, or performing optimization and analysis of this level. To this end, we propose here a new format/model (named GRC) for the intermediate representation of Esterel programs. The new format has formal constructive semantics, being able to represent all the Esterel programs. It describes with separate (but interdependent) structures the hierarchic state of the Esterel program and its destructured control flow. Thus, it is a good support for both (1) efficient low-cost optimizations based on static analysis that use high-level structural information and (2) low-level control flow optimizations. Finally, the format is a good starting point for efficient scheduling algorithms. Our contribution consists in the following : - The precise definition of the semantics of the full Esterel language ; - The definition of the GRC format (including the formal correspondence between its semantics and the “circuit” semantics) ; - A characterization, at GRC level, of the programs that are translated into cyclic circuits ; - The development of an optimizing GRC-based prototype C code generator. The prototype is currently able to compile the programs whose GRC representation is acyclic. Sequential code is generated in these cases by statically scheduling the acyclic GRC flowgraph. The compiler includes novel optimization algorithms, based on static analysis, and an efficient state encoding technique. The results are encouraging, as our prototype seems to compare well against existing compilers

Стилі APA, Harvard, Vancouver, ISO та ін.

Irfan, Muhammad Naeem. "Analyse et optimisation d'algorithmes pour l'inférence de modèles de composants logiciels." Phd thesis, Université de Grenoble, 2012. http://tel.archives-ouvertes.fr/tel-00767894.

Повний текст джерела

Анотація:

Les Components-Off-The-Shelf (COTS) sont utilisés pour le développement rapide et efficace de logiciels tout en limitant le coût. Il est important de tester le fonctionnement des composants dans le nouvel environnement. Pour les logiciels tiers,le code source des composants, les spécifications et les modèles complets ne sont pas disponibles. Dans la littérature de tels systèmes sont appelés composants "boîte noire". Nous pouvons vérifier leur fonctionnement avec des tests en boîte noire tels que le test de non-régression, le test aléatoire ou le test à partir de modèles. Pour ce dernier, un modèle qui représente le comportement attendu du système sous test(SUT) est nécessaire. Ce modèle contient un ensemble d'entrées, le comportement du SUT après stimulation par ces entrées et l'état dans lequel le système se trouve.Pour les systèmes en boîte noire, les modèles peuvent être extraits à partir des traces d'exécutions, des caractéristiques disponibles ou encore des connaissances des experts. Ces modèles permettent ensuite d'orienter le test de ces systèmes.Les techniques d'inférence de modèles permettent d'extraire une information structurelle et comportementale d'une application et de la présenter sous forme d'un modèle formel. Le modèle abstrait appris est donc cohérent avec le comportement du logiciel. Cependant, les modèles appris sont rarement complets et il est difficile de calculer le nombre de tests nécessaires pour apprendre de façon complète et précise un modèle.Cette thèse propose une analyse et des améliorations de la version Mealy de l'algorithme d'inférence L* [Angluin 87]. Elle vise à réduire le nombre de tests nécessaires pour apprendre des modèles. La version Mealy de L* nécessite d'utiliser deux types de test. Le premier type consiste à construire les modèles à partir des sorties du système, tandis que le second est utilisé pour tester l'exactitude des modèles obtenus. L'algorithme utilise ce que l'on appelle une table d'observation pour enregistrer les réponses du système.Le traitement d'un contre-exemple peut exiger d'envoyer un nombre conséquent de requêtes au système. Cette thèse aborde ce problème et propose une technique qui traite les contre-exemples de façon efficace. Nous observons aussi que l'apprentissage d'un modèle ne nécessite pas de devoir remplir complètement ces tables. Nous proposons donc un algorithme d'apprentissage qui évite de demander ces requêtes superflues.Dans certains cas, pour apprendre un modèle, la recherche de contre-exemples peut coûter cher. Nous proposons une méthode qui apprend des modèles sans demander et traiter des contre-exemples. Cela peut ajouter de nombreuses colonnes à la table d'observation mais au final, nous n'avons pas besoin d'envoyer toutes les requêtes. Cette technique ne demande que les requêtes nécessaires.Ces contributions réduisent le nombre de tests nécessaires pour apprendre des modèles de logiciels, améliorant ainsi la complexité dans le pire cas. Nous présentons les extensions que nous avons apportées à l'outil RALT pour mettre en oeuvre ces algorithmes. Elles sont ensuite validées avec des exemples tels que les tampons, les distributeurs automatiques, les protocoles d'exclusion mutuelle et les planificateurs.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hast, Matteus. "Evaluation of machine learning algorithms for customer demand prediction of in-flight meals." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-255020.

Повний текст джерела

Анотація:

This study aims to evaluate multiple Machine Learning Algorithms (MLAs) for estimating the customer demand of in-flight meals. As a result of the review of related works, four MLAs were selected, namely Linear Regression (LR), Support Vector Regression (SVR), Extreme Gradient Boosting (XGBoost) and a Multilayer Perceptron Neural Network (MLP). The study investigates which MLA is best suited for the problem at hand and which features are most influential for customer demand prediction of in-flight meals. Focus is put on finding applicable MLAs and on evaluating, comparing and tweaking the parameters of the MLAs to further optimise the selected models. The available data set comes from a single airline company and consists mainly of flights with a short to medium long flight duration time.The results show that the four evaluated models, LR, SVR, XGBoost and MLP performs with no significant difference against one another and are comparable in their performance in regard to estimation accuracy with results close to each other’s. However, the SVR model underperforms in regard to model fitting and prediction time in comparison towards the remaining three models. Furthermore, the most important feature for customer demand prediction of in-flight meals is the scheduled flight duration time.
Syftet med den här studien är att utvärdera ett flertal maskininlärningsalgoritmer för prediktering av konsumentefterfrågan för måltider under flygning. Undersökningen över tidigare arbeten utförda i liknande fält resulterade i att fyra maskininlärningsalgoritmer blev valda, nämligen linjär regression, stödvektormaskin för regression, Extreme Gradient Boosting och ett flerlagersperceptron-neuronnät. Studien utforskar vilken maskininlärningsalgoritm som är bäst anpassad för att prediktera problemet samt vilka egenskaper i datat som är mest inflytesrika när det handlar om att prediktera konsumentefterfrågan av måltider under flygning. Fokus ligger på att finna applicerbara maskininlärningsalgoritmer och på att utvärdera, jämföra samt på att justera parametrarna i syfte till att optimera modellerna. Den tillgängliga datan härstammar från ett enstaka flygbolag och består mestadels av korta och mediumlånga flyg.Resultatet påvisar att de fyra modellerna, linjär regression, en stödvektormaskin för regression, Extreme Gradient Boosting och ett flerlagersperceptron-neuronnät presterar utan någon signifikant skillnad gentemot varandra och är jämförbara i deras prestation i avseende till predikteringprecision med liknande resultat. I avseende till modellanpassningsoch predikteringstid underpresterar dock stödvektormaskinen avsevärt i jämförelse med de resterande tre modellerna. Resultatet visar även att den viktigaste egenskapen i datat för prediktering av konsumentefterfrågan av måltider under flygning är den schemalagda flygtiden.

Стилі APA, Harvard, Vancouver, ISO та ін.

Guignard, Anaïs. "Validation fonctionnelle de contrôleurs logiques : contribution au test de conformité et à l'analyse en boucle fermée." Thesis, Cachan, Ecole normale supérieure, 2014. http://www.theses.fr/2014DENS0050/document.

Повний текст джерела

Анотація:

Les travaux présentés dans ce mémoire de thèse s'intéressent à la validation fonctionnelle de contrôleurs logiques par des techniques de test de conformité et de validation en boucle fermée. Le modèle de spécification est décrit dans le langage industriel Grafcet et le contrôleur logique est supposé être un automate programmable industriel (API) mono-tâche. Afin de contribuer à ces techniques de validation fonctionnelle, ces travaux présentent : - Une extension d'une méthode de formalisation du Grafcet par traduction sous la forme d'une machine de Mealy. Cette extension permet de produire un modèle formel de la spécification lorsque le Grafcet est implanté selon un mode d'interprétation sans recherche de stabilité, qui n'est pas préconisé dans la norme IEC 60848 mais largement utilisé dans les applications industrielles. - Une contribution au test de conformité par la définition d'un ensemble de relations de conformité basées sur l'observation de plusieurs cycles d'exécution pour chaque pas de test. - Une contribution à la validation en boucle fermée par la définition d'un critère de fin d'observation et par une technique d'identification en boite grise pour la construction et l'analyse du système en boucle fermée
The results presented in this PhD thesis deal with functional validation of logic controllers using conformance test and closed-loop validation techniques. The specification model is written in the Grafcet language and the logic controller is assumed to be a Programmable Logic Controller (PLC). In order to contribute to these validation techniques, this thesis presents: - An axtension to a fomalization methods for Grafcet languages by translation to a Mealy machine. This extension generates a formal model of a Grafcet specification that is interpreted without search of stability. This mode of interpretation is not recommended by the standard IEC 60848 but is widely used in industrial applications. - A contribution to conformance test by a definition of a set of conformance relation based on the observation of several execution cycles for each test step. - A contribution to closed-loop validation by the definition of a termination criterion and by a new gray-box identification technique that is used for construction and analysis of the closed-loop system

Стилі APA, Harvard, Vancouver, ISO та ін.

Matušová, Lucie. "Automatická konstrukce hlídacích obvodů založených na konečných automatech." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-235407.

Повний текст джерела

Анотація:

Cílem této práce bylo studium aktivního učení automatů, navržení a implementace softwarové architektury pro automatickou konstrukci hlídacího obvodu dané jednotky implementované v FPGA a ověření funkčnosti hlídacího obvodu pomocí injekce poruch. Hlídací obvod, tzv. online checker, má za úkol zabezpečovat danou jednotku proti poruchám. Checker je konstruován z modelu odvozeného pomocí aktivního učení automatů, které probíhá na základě komunikace se simulátorem. Pro implementaci učícího prostředí byla použita knihovna LearnLib, která poskytuje algoritmy aktivního učení automatů a jejich optimalizace. Byla navržena a implementována experimentální platforma umožňující řízenou injekci poruch do designu v FPGA, která slouží k otestování checkeru. Výsledky experimentů ukazují, že při použití checkeru a rekonfigurace je možné snížit chybovost designu o více než 98%.

Стилі APA, Harvard, Vancouver, ISO та ін.

Golden, Boris. "A unified formalism for complex systems architecture." Palaiseau, Ecole polytechnique, 2013. http://pastel.archives-ouvertes.fr/docs/00/82/71/07/PDF/phd.pdf.

Повний текст джерела

Анотація:

Les systèmes industriels complexes sont des objets artificiels conçus par l'Homme, et constitués d'un grand nombre de composants hétérogènes (e. G. Matériels, logiciels ou organisationnels) collaborant pour accomplir une mission globale. Dans cette thèse, nous nous intéressons à la modélisation du comportement fonctionnel de tels systèmes, ainsi qu'à leur intégration. Nous modéliserons donc les systèmes réels par le biais d'une approche de boîte noire fonctionnelle avec un état interne, dont la structure et le comportement fonctionnel peuvent être obtenus par l'intégration récursive de composants élémentaires hétérogènes
Complex industrial systems are typically artificial objects designed by men, involving a huge number of heterogeneous components (e. G. Hardware, software, or human organizations) working together to perform a mission. In this thesis, we are interested in modeling the functional behavior of such systems, and their integration. We will model real systems as functional black boxes (with an internal state), whose structure and behaviors can be described by the recursive integration of heterogeneous smaller subsystems. Our purpose is to give a unified and minimalist semantics for heterogeneous integrated systems and their integration

Стилі APA, Harvard, Vancouver, ISO та ін.

Golden, Boris. "Un formalisme unifié pour l'architecture des systèmes complexes." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00827107.

Повний текст джерела

Анотація:

Les systèmes industriels complexes sont des objets artificiels conçus par l'Homme, et constitués d'un grand nombre de composants hétérogènes (e.g. matériels, logiciels ou organisationnels) collaborant pour accomplir une mission globale. Dans cette thèse, nous nous intéressons à la modélisation du comportement fonctionnel de tels systèmes, ainsi qu'à leur intégration. Nous modéliserons donc les systèmes réels par le biais d'une approche de boîte noire fonctionnelle avec un état interne, dont la structure et le comportement fonctionnel peuvent être obtenus par l'intégration récursive de composants élémentaires hétérogènes.

Стилі APA, Harvard, Vancouver, ISO та ін.

Martins, André Batista. "Prototyping a calculus of QoS : aware software components." Master's thesis, 2011. http://hdl.handle.net/1822/27926.

Повний текст джерела

Анотація:

Dissertação de mestrado em Engenharia de Informática
Over the last decade component-based software development arose as a promising paradigm to deal with the ever increasing complexity in software design, evolution and reuse. Such components typically encapsulate a number of services through a public interface which provides limited access to a private state space, paying tribute to the nowadays widespread object-oriented programming principles. This work is based on the calculus developed by L.S. Barbosa over several years and it aims at helping the development of formal software component solutions and to explain how they can be related, reducing their complexity. SHACC is a prototyping system for component-based systems in which components are modeled coinductively as generalized Mealy machines incorporating the ideas above. The prototype is built as a HASKELL library endowed with a graphical user interface developed in Swing.

Стилі APA, Harvard, Vancouver, ISO та ін.

Groth, Thorsten. "Equations in Self-Similar Groups." Doctoral thesis, 2018. http://hdl.handle.net/11858/00-1735-0000-002E-E358-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Machines de Mealy"

Weight loss spirializer vegetable cookbook: 101 low-carb recipes that turn vegetables into deliciously satisfying meals using Paderno, Veggetti, iPerfect, & Brieftons spiralizers. San Francisco, California: HHF Press, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

How many machine guns does it take to cook one meal?: The Seattle and San Francisco general strikes. Seattle: University of Washington Press, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

200TPD Super Fine Maize Meal Machine: 200TPD Super Fine Maize Meal Machine. win: Win Tone, 2017.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Inspiralized: Turn Vegetables into Healthy, Creative, Satisfying Meals. Clarkson Potter, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pot, Jimmy Emmerich. Keto Slow Cooker Cookbook: Make Your Body a Fat-Burning Machine with Delicious Meals Using the Slow Cooker - Get Ketogenic Weight Loss With Sugar-Free, Low-Cholesterol, Low-Carb Recipes & Meal Plan. Charlie Creative Lab, 2021.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Johnson, Victoria. How Many Machine Guns Does It Take to Cook One Meal?: The Seattle and San Francisco General Strikes. University of Washington Press, 2015.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aristotelous, Aimee. 30-Day Keto Plan: Ketogenic Meal Plans to Kick Your Sugar Habit and Make Your Gut a Fat Burning Machine. Skyhorse Publishing Company, Incorporated, 2020.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Aristotelous, Aimee, and Richard Oliva. 30-Day Keto Plan: Ketogenic Meal Plans to Kick Your Sugar Habit and Make Your Gut a Fat-Burning Machine. Skyhorse Publishing Company, Incorporated, 2020.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pot, Melissa. Bread Machine Cookbook: A Complete Keto Guide for Making Bread at Home Even If You Are a Beginner. a Cooking Technique for a Tasty Meal with Good Bread. Independently Published, 2020.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Machines de Mealy"

Shahbaz, Muzammil, and Roland Groz. "Inferring Mealy Machines." In FM 2009: Formal Methods, 207–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05089-3_14.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Borowik, Bohdan, Mykola Karpinskyy, Valery Lahno, and Oleksandr Petrov. "Machines Moore and Mealy." In Intelligent Systems, Control and Automation: Science and Engineering, 143–71. Dordrecht: Springer Netherlands, 2012. http://dx.doi.org/10.1007/978-94-007-5228-3_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Vaandrager, Frits, Roderick Bloem, and Masoud Ebrahimi. "Learning Mealy Machines with One Timer." In Language and Automata Theory and Applications, 157–70. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68195-1_13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bonsangue, M. M., Jan Rutten, and Alexandra Silva. "Coalgebraic Logic and Synthesis of Mealy Machines." In Foundations of Software Science and Computational Structures, 231–45. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78499-9_17.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Barkalov, Alexander, Larysa Titarenko, Malgorzata Kolopienczyk, Kamil Mielcarek, and Grzegorz Bazydlo. "Design of EMB-Based Mealy FSMs." In Logic Synthesis for FPGA-Based Finite State Machines, 193–237. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24202-6_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Barkalov, Alexander, Larysa Titarenko, and Jacek Bieganowski. "Hardware Reduction for Mealy UFSMs." In Logic Synthesis for Finite State Machines Based on Linear Chains of States, 95–119. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-59837-6_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Nedjah, Nadia, Marcos Paulo Mello Araujo, and Luiza de Macedo Mourelle. "Mealy Finite State Machines: A Quantum Inspired Evolutionary Approach." In Atlantis Computational Intelligence Systems, 21–56. Paris: Atlantis Press, 2010. http://dx.doi.org/10.2991/978-94-91216-30-5_2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Abel, Andreas, and Jan Reineke. "Gray-Box Learning of Serial Compositions of Mealy Machines." In Lecture Notes in Computer Science, 272–87. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-40648-0_21.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Barkalov, Alexander, Larysa Titarenko, Malgorzata Kolopienczyk, Kamil Mielcarek, and Grzegorz Bazydlo. "Object Codes Transformation for Mealy FSMsObject codes transformation (OCT)." In Logic Synthesis for FPGA-Based Finite State Machines, 65–95. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24202-6_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Attiogbé, Christian. "Deriving Event-B Models from Mealy Machines: Application to an Auction System." In Model and Data Engineering, 77–88. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23781-7_7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Machines de Mealy"

Sharan, Shambhu, and S. P. Tiwari. "Products of Mealy-type rough finite state machines." In 2012 National Conference on Computing and Communication Systems (NCCCS). IEEE, 2012. http://dx.doi.org/10.1109/ncccs.2012.6412988.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Abel, Andreas, and Jan Reineke. "MEMIN: SAT-based exact minimization of incompletely specified Mealy machines." In 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD). IEEE, 2015. http://dx.doi.org/10.1109/iccad.2015.7372555.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Abadi, Eden, and Ronen I. Brafman. "Learning and Solving Regular Decision Processes." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/270.

Повний текст джерела

Анотація:

Regular Decision Processes (RDPs) are a recently introduced model that extends MDPs with non-Markovian dynamics and rewards. The non-Markovian behavior is restricted to depend on regular properties of the history. These can be specified using regular expressions or formulas in linear dynamic logic over finite traces. Fully specified RDPs can be solved by compiling them into an appropriate MDP. Learning RDPs from data is a challenging problem that has yet to be addressed, on which we focus in this paper. Our approach rests on a new representation for RDPs using Mealy Machines that emit a distribution and an expected reward for each state-action pair. Building on this representation, we combine automata learning techniques with history clustering to learn such a Mealy machine and solve it by adapting MCTS to it. We empirically evaluate this approach, demonstrating its feasibility.

Стилі APA, Harvard, Vancouver, ISO та ін.

Fernandes, Danilo Douradinho, Felipe Rafael Mota Cardoso, Denis Ávila Montini, Francisco Marcondes Supino, Paulo Marcelo Tasinaffo, and Luiz Alberto Vieira Dias. "An Algorithm Model to Mapping Mealy Machines for a Software Manufacture Cell Petri Net." In 2010 Seventh International Conference on Information Technology: New Generations. IEEE, 2010. http://dx.doi.org/10.1109/itng.2010.83.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Klimowicz, Adam, and Valery Salauyou. "The Synthesis of Combined Mealy and Moore Machines Structural Model Using Values of Output Variables as Codes of States." In 2012 15th Euromicro Conference on Digital System Design (DSD). IEEE, 2012. http://dx.doi.org/10.1109/dsd.2012.130.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Alechina, Natasha, Giuseppe De Giacomo, Brian Logan, and Giuseppe Perelli. "Automatic Synthesis of Dynamic Norms for Multi-Agent Systems." In 19th International Conference on Principles of Knowledge Representation and Reasoning {KR-2022}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/kr.2022/2.

Повний текст джерела

Анотація:

Norms have been widely proposed to coordinate and regulate multi-agent systems (MAS) behaviour. We consider the problem of synthesising and revising the set of norms in a normative MAS to satisfy a design objective expressed in Alternating Time Temporal Logic (ATL*). ATL* is a well-established language for strategic reasoning, which allows the specification of norms that constrain the strategic behaviour of agents. We focus on dynamic norms, that is, norms corresponding to Mealy machines, that allow us to place different constraints on the agents' behaviour depending on the state of the norm and the state of the underlying MAS. We show that synthesising dynamic norms is (k + 1)-EXPTIME, where k is the alternation depth of quantifiers in the ATL* specification. Note that for typical cases of interest, k is either 1 or 2. We also study the problem of removing existing norms to satisfy a new objective, which we show to be 2EXPTIME-complete.

Стилі APA, Harvard, Vancouver, ISO та ін.

Roßmann, Ju¨rgen, Michael Schluse, and Thomas Jung. "Introducing Intuitive and Versatile Multi Modal Graphical Programming Means to Enhance Virtual Environments." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49517.

Повний текст джерела

Анотація:

Usability and versatility are two of the most important issues when using modern 3D simulation systems within the field of automation technology and virtual environments. 3D simulations and virtual worlds proved to be versatile tools to program, supervise and command complex robotic and automation systems. For industrial robots, 3D simulation systems like COSIMIR® introduced the so called Native Language Programming (NLP) concept enabling the automation expert to program each robot using its native programming language. But what about programming other automation components or other dynamic components in virtual environments, what about user friendly, intuitive graphical programming languages, what about easy-to-use worker oriented programming languages? When talking about graphical programming languages to model dynamic behavior, questions like “which graphical modeling languages should be supported?”, “which are the most powerful ones?” and “which one matches the most to my concrete application?” have to be answered. Each graphical programming language has its own advantages and disadvantages, so that the answer to all these questions has to be: Offer a choice of graphical modeling languages to the user and leave the decision to him. The advantage of this strategy is obvious: Instead of learning how to use a concrete modeling language or worrying about programming details, the user can focus on his individual automation task and so quickly build efficient solutions. Therefore this paper extends the NLP approach to graphical programming languages using a new kind of object oriented Petri Nets as an intermediate language. This enables the user to use — at the same time — finite automata like mealy machines or extended automata, activity diagrams as defined in UML 2, flowchart like diagrams (e. g. icon-based programming) and many more to model the dynamics or the behavior of dynamic components.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhong, Zhiwei, Zhen Li, Lulu Ge, Xiaohu You, and Chuan Zhang. "Implementation of Mealy Machine with Molecular Reactions." In 2018 IEEE International Conference on Communications (ICC 2018). IEEE, 2018. http://dx.doi.org/10.1109/icc.2018.8422571.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Luokai Hu, Shi Ying, and Kai Zhao. "A Mealy machine based modeling approach for semantic programming language." In 2010 2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR 2010). IEEE, 2010. http://dx.doi.org/10.1109/car.2010.5456555.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Prasanna, P. Sai, B. Rithvej, and JVR Ravindra. "Conversion of mealy to Moore machine for safety critical systems." In 1ST INTERNATIONAL CONFERENCE ON ADVANCES IN SIGNAL PROCESSING, VLSI, COMMUNICATIONS AND EMBEDDED SYSTEMS: ICSVCE-2021. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0074240.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!