Готові списки джерел за темами / Probabilistic automaton

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Добірка наукової літератури з теми "Probabilistic automaton"

Автор: Grafiati
Опубліковано: 30 травня 2022
Оновлено: 31 травня 2022

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

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

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

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

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

Статті в журналах з теми "Probabilistic automaton"

1

Sánchez, Joan Andreu, Martha Alicia Rocha, Verónica Romero, and Mauricio Villegas. "On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models." Computational Linguistics 44, no. 1 (March 2018): 17–37. http://dx.doi.org/10.1162/coli_a_00306.

Повний текст джерела
Анотація:
Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing. Probabilistic finite-state automata are closely related to other finite-state models as weighted finite-state automata, word lattices, and hidden Markov models. Therefore, they share many similar properties and problems. Entropy measures of finite-state models have been investigated in the past in order to study the information capacity of these models. The derivational entropy quantifies the uncertainty that the model has about the probability distribution it represents. The derivational entropy in a finite-state automaton is computed from the probability that is accumulated in all of its individual state sequences. The computation of the entropy from a weighted finite-state automaton requires a normalized model. This article studies an efficient computation of the derivational entropy of left-to-right probabilistic finite-state automata, and it introduces an efficient algorithm for normalizing weighted finite-state automata. The efficient computation of the derivational entropy is also extended to continuous hidden Markov models.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

CORTES, CORINNA, MEHRYAR MOHRI, ASHISH RASTOGI, and MICHAEL RILEY. "ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA." International Journal of Foundations of Computer Science 19, no. 01 (February 2008): 219–42. http://dx.doi.org/10.1142/s0129054108005644.

Повний текст джерела
Анотація:
We present an exhaustive analysis of the problem of computing the relative entropy of two probabilistic automata. We show that the problem of computing the relative entropy of unambiguous probabilistic automata can be formulated as a shortest-distance problem over an appropriate semiring, give efficient exact and approximate algorithms for its computation in that case, and report the results of experiments demonstrating the practicality of our algorithms for very large weighted automata. We also prove that the computation of the relative entropy of arbitrary probabilistic automata is PSPACE-complete. The relative entropy is used in a variety of machine learning algorithms and applications to measure the discrepancy of two distributions. We examine the use of the symmetrized relative entropy in machine learning algorithms and show that, contrarily to what is suggested by a number of publications in that domain, the symmetrized relative entropy is neither positive definite symmetric nor negative definite symmetric, which limits its use and application in kernel methods. In particular, the convergence of training for learning algorithms is not guaranteed when the symmetrized relative entropy is used directly as a kernel, or as the operand of an exponential as in the case of Gaussian Kernels. Finally, we show that our algorithm for the computation of the entropy of an unambiguous probabilistic automaton can be generalized to the computation of the norm of an unambiguous probabilistic automaton by using a monoid morphism. In particular, this yields efficient algorithms for the computation of the Lp-norm of a probabilistic automaton.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

BOCCARA, N., J. NASSER, and M. ROGER. "CRITICAL BEHAVIOR OF A PROBABILISTIC LOCAL AND NONLOCAL SITE-EXCHANGE CELLULAR AUTOMATON." International Journal of Modern Physics C 05, no. 03 (June 1994): 537–45. http://dx.doi.org/10.1142/s0129183194000714.

Повний текст джерела
Анотація:
We study the critical behavior of a probabilistic automata network whose local rule consists of two subrules. The first one, applied synchronously, is a probabilistic one-dimensional range-one cellular automaton rule. The second, applied sequentially, exchanges the values of a pair of sites. According to whether the two sites are first-neighbors or not, the exchange is said to be local or nonlocal. The evolution of the system depends upon two parameters, the probability p characterizing the probabilistic cellular automaton, and the degree of mixing m resulting from the exchange process. Depending upon the values of these parameters, the system exhibits a bifurcation similar to a second order phase transition characterized by a nonnegative order parameter, whose role is played by the stationary density of occupied sites. When m is very large, the correlations created by the application of the probabilistic cellular automaton rule are destroyed, and, as expected, the behavior of the system is then correctly predicted by a mean-field-type approximation. According to whether the exchange of the site values is local or nonlocal, the critical behavior is qualitatively different as m varies.
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Rajewsky, Nikolaus, and Michael Schreckenberg. "A Probabilistic Cellular Automaton for Evolution." Journal de Physique I 5, no. 9 (September 1995): 1129–34. http://dx.doi.org/10.1051/jp1:1995186.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Nishidate, Kazume, Mamoru Baba, Hideyuki Chiba, Takanori Ito, Kouichi Kodama, and Kiyoshi Nishikawa. "Probabilistic Cellular Automaton for Random Walkers." Journal of the Physical Society of Japan 69, no. 5 (May 15, 2000): 1352–55. http://dx.doi.org/10.1143/jpsj.69.1352.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

FREIVALDS, RŪSIŅŠ. "NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA." International Journal of Foundations of Computer Science 19, no. 03 (June 2008): 565–80. http://dx.doi.org/10.1142/s0129054108005826.

Повний текст джерела
Анотація:
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. However, the proof is non-constructive. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures not proved but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

BHATTACHARYYA, PRATIP. "GROWTH OF SURFACES GENERATED BY A PROBABILISTIC CELLULAR AUTOMATION." International Journal of Modern Physics C 10, no. 01 (February 1999): 165–81. http://dx.doi.org/10.1142/s0129183199000115.

Повний текст джерела
Анотація:
A one-dimensional cellular automaton with a probabilistic evolution rule can generate stochastic surface growth in (1+1) dimensions. Two such discrete models of surface growth are constructed from a probabilistic cellular automaton which is known to show a transition from an active phase to an absorbing phase at a critical probability associated with two particular components of the evolution rule. In one of these models, called Model A in this paper, the surface growth is defined in terms of the evolving front of the cellular automaton on the space-time plane. In the other model, called Model B, surface growth takes place by a solid-on-solid deposition process controlled by the cellular automaton configurations that appear in successive time-steps. Both the models show a depinning transition at the critical point of the generating cellular automaton. In addition, Model B shows a kinetic roughening transition at this point. The characteristics of the surface width in these models are derived by scaling arguments from the critical properties of the generating cellular automaton and by Monte Carlo simulations.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Bušić, Ana, Jean Mairesse, and Irène Marcovici. "Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling." Advances in Applied Probability 45, no. 04 (December 2013): 960–80. http://dx.doi.org/10.1017/s0001867800006728.

Повний текст джерела
Анотація:
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Bušić, Ana, Jean Mairesse, and Irène Marcovici. "Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling." Advances in Applied Probability 45, no. 4 (December 2013): 960–80. http://dx.doi.org/10.1239/aap/1386857853.

Повний текст джерела
Анотація:
A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Nederhof, Mark-Jan. "A General Technique to Train Language Models on Language Models." Computational Linguistics 31, no. 2 (June 2005): 173–85. http://dx.doi.org/10.1162/0891201054223986.

Повний текст джерела
Анотація:
We show that under certain conditions, a language model can be trained on the basis of a second language model. The main instance of the technique trains a finite automaton on the basis of a probabilistic context-free grammar, such that the Kullback-Leibler distance between grammar and trained automaton is provably minimal. This is a substantial generalization of an existing algorithm to train an n-gram model on the basis of a probabilistic context-free grammar.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "Probabilistic automaton"

1

Semyonov, S. G., Svitlana Gavrylenko, and Viktor Chelak. "Processing information on the state of a computer system using probabilistic automata." Thesis, Institute of Electrical and Electronics Engineers, 2017. http://repository.kpi.kharkov.ua/handle/KhPI-Press/40752.

Повний текст джерела
Анотація:
The paper deals with the processing of information about the state of a computer system using a probabilistic automaton. A model of an intelligent system for detection and classification of malicious software is proposed, which compares a set of features that are characteristic for different classes of viruses with multiple states of the machine. The analysis process is reduced to modeling the operation of the automaton taking into account the probability of transition from state to state, which at each step is recalculated depending on the reaction of the environment. The received results of research allow to reach a conclusion about the possibility of using the offered system for detection of the harmful software.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Turnes, Junior Pericles do Prado. "Um modelo para avaliar a validade da hipótese de mistura homogênea em sistemas epidemiológicos." Universidade Presbiteriana Mackenzie, 2014. http://tede.mackenzie.br/jspui/handle/tede/1524.

Повний текст джерела
Анотація:
Made available in DSpace on 2016-03-15T19:38:51Z (GMT). No. of bitstreams: 1 Pericles do Prado Turnes Junior.pdf: 1375255 bytes, checksum: 24dc630ef135368b840995d533e161e8 (MD5) Previous issue date: 2014-07-29
Instituto Presbiteriano Mackenzie
There are many epidemiological models written in terms of ordinary differential equations (ODE). This approach is based on the homogeneous mixing assumption; that is, the topological structure of the network of social contacts, established by the individuals in the population, is not relevant to forecast the propagation of the studied pathogen. In this work, an epidemiological model formulated in terms of ODE and probabilistic cellular automata (PCA) is proposed to study the spread of contagious diseases that do not conferimmunity. The state variables of this model are the percentages of susceptible individuals, infected individuals and empty space. It is shown that this dynamical system can experience Hopf and transcritical bifurcations. Then, this model is used to evaluate the validity of the homogeneous mixing assumption, by using real data related to the transmission of gonorrhea, hepatitis C virus, human immunodeficiency virus and obesity.
Muitos modelos epidemiológicos são escritos em termos de equações diferenciais ordinárias (EDO). Essa abordagem baseia-se no pressuposto de mistura homogênea; ou seja, a estrutura topológica da rede de contatos sociais, estabelecida pelos indivíduos da população, não é relevante para prever o avanço do patógeno em estudo. Neste trabalho, é proposto um modelo epidemiológico formulado em termos de EDO e de autômato celular probabilista (ACP) para estudar a propagação de doenças contagiosas que não conferem imunidade. As variáveis de estado desse modelo são as porcentagens de indivíduos suscetíveis, de indivíduos infectados e de espaço vazio. Mostra-se que esse sistema dinâmico pode apresentar bifurcações de Hopf e transcrítica. O modelo é , então, usado para avaliar a validade da hipótese de mistura homogênea, usando dados relacionados à transmissão de gonorreia, vírus da hepatite C, vírus da imunodeficiência humana e obesidade.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Casse, Jérôme. "Automates cellulaires probabilistes et processus itérés ad libitum." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0248/document.

Повний текст джерела
Анотація:
La première partie de cette thèse porte sur les automates cellulaires probabilistes (ACP) sur la ligne et à deux voisins. Pour un ACP donné, nous cherchons l'ensemble de ces lois invariantes. Pour des raisons expliquées en détail dans la thèse, ceci est à l'heure actuelle inenvisageable de toutes les obtenir et nous nous concentrons, dans cette thèse, surles lois invariantes markoviennes. Nous établissons, tout d'abord, un théorème de nature algébrique qui donne des conditions nécessaires et suffisantes pour qu'un ACP admette une ou plusieurs lois invariantes markoviennes dans le cas où l'alphabet E est fini. Par la suite, nous généralisons ce résultat au cas d'un alphabet E polonais après avoir clarifié les difficultés topologiques rencontrées. Enfin, nous calculons la fonction de corrélation du modèleà 8 sommets pour certaines valeurs des paramètres du modèle en utilisant une partie desrésultats précédents
The first part of this thesis is about probabilistic cellular automata (PCA) on the line and with two neighbors. For a given PCA, we look for the set of its invariant distributions. Due to reasons explained in detail in this thesis, it is nowadays unthinkable to get all of them and we concentrate our reections on the invariant Markovian distributions. We establish, first, an algebraic theorem that gives a necessary and sufficient condition for a PCA to have one or more invariant Markovian distributions when the alphabet E is finite. Then, we generalize this result to the case of a polish alphabet E once we have clarified the encountered topological difficulties. Finally, we calculate the 8-vertex model's correlation function for some parameters values using previous results.The second part of this thesis is about infinite iterations of stochastic processes. We establish the convergence of the finite dimensional distributions of the α-stable processes iterated n times, when n goes to infinite, according to parameter of stability and to drift r. Then, we describe the limit distributions. In the iterated Brownian motion case, we show that the limit distributions are linked with iterated functions system
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Moraes, Ana Leda Silva. "Avaliando a influência de indivíduos imunes na propagação de doenças contagiosas." Universidade Presbiteriana Mackenzie, 2016. http://tede.mackenzie.br/jspui/handle/tede/1471.

Повний текст джерела
Анотація:
Made available in DSpace on 2016-03-15T19:38:04Z (GMT). No. of bitstreams: 1 ANA LEDA SILVA MORAES.pdf: 1708515 bytes, checksum: 8e07dd190f9a5fd165c14e35c2c626b0 (MD5) Previous issue date: 2016-02-01
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Epidemiology is the science that studies the occurrence of diseases in a population. The results of these studies allow a comprehension of a disease propagation and enable actions in order to control epidemics. There are many mathematical models used in epidemiological studies; in which SIR-like models are the most used. In this model, the population is divided into three groups: S - susceptible individuals to infection, I - infected individuals, and R - recovered individuals. The proposal of this thesis is, based on a new SIR model, taking into consideration the effect of recovered individuals on the propagation of contagious diseases and on the recovery of sick individuals. This can be relevant to the study of propagation of typical diseases in children, since immune individuals can catalyze the encounters among susceptible children and infected children, as well as to contribute to the recovery of sick individuals. The predictive ability of the proposed model is evaluated from the records refering to the incidence of chickenpox in Belgium, Germany and Italy, in a pre-vaccination era.
Epidemiologia é a ciência que estuda as ocorrências de doenças numa população. Os resultados desses estudos permitem uma compreensão do comportamento da incidência da doença e possibilita ações a fim de controlar epidemias. Há vários modelos matemáticos que são utilizados para estudos epidemiológicos, sendo modelos do tipo SIR os mais empregados. Nesse modelo, divide-se a população em três classes: 𝑆 - indivíduos suscetíveis à infecção, 𝐼 - indivíduos infectados, e 𝑅 - indivíduos recuperados. A proposta desta dissertação é, a partir de um novo modelo SIR, levar em consideração o efeito de indivíduos recuperados na propagação de doenças contagiosas e na recuperação de indivíduos doentes. Isso pode ser relevante no estudo da propagação de infecções típicas de crianças, já que indivíduos imunes podem servir como catalisador de encontros entre crianças suscetíveis e crianças infectadas, bem como contribuir para a recuperação de indivíduos doentes. A capacidade preditiva do modelo proposto é avaliada a partir dos registros referentes à incidência de varicela na Alemanha, Bélgica e Itália, numa era pré-vacinação.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Shirmohammadi, Mahsa. "Qualitative analysis of synchronizing probabilistic systems." Thesis, Cachan, Ecole normale supérieure, 2014. http://www.theses.fr/2014DENS0054/document.

Повний текст джерела
Анотація:
Les Markov Decision Process (MDP) sont des systèmes finis probabilistes avec à la fois des choix aléatoires et des stratégies, et sont ainsi reconnus comme de puissants outils pour modéliser les interactions entre un contrôleur et les réponses aléatoires de l'environment. Mathématiquement, un MDP peut être vu comme un jeu stochastique à un joueur et demi où le contrôleur choisit à chaque tour une action et l'environment répond en choisissant un successeur selon une distribution de probabilités fixée.Il existe deux incomparables représentations du comportement d'un MDP une fois les choix de la stratégie fixés.Dans la représentation classique, un MDP est un générateur de séquences d'états, appelées state-outcome; les conditions gagnantes du joueur sont ainsi exprimées comme des ensembles de séquences désirables d'états qui sont visités pendant le jeu, e.g. les conditions de Borel telles que l'accessibilité. La complexité des problèmes de décision ainsi que la capacité mémoire requise des stratégies gagnantes pour les conditions dites state-outcome ont été déjà fortement étudiées.Depuis peu, les MDPs sont également considérés comme des générateurs de séquences de distributions de probabilités sur les états, appelées distribution-outcome. Nous introduisons des conditions de synchronisation sur les distributions-outcome, qui intuitivement demandent à ce que la masse de probabilité s'accumule dans un (ensemble d') état, potentiellement de façon asymptotique.Une distribution de probabilités est p-synchrone si la masse de probabilité est d'au moins p dans un état; et la séquence de distributions de probabilités est toujours, éventuellement, faiblement, ou fortement p-synchrone si, respectivement toutes, certaines, infiniment plusieurs ou toutes sauf un nombre fini de distributions dans la séquence sont p-synchrones.Pour chaque type de synchronisation, un MDP peut être(i) assurément gagnant si il existe une stratégie qui génère une séquence 1-synchrone;(ii) presque-assurément gagnant si il existe une stratégie qui génère une séquence (1-epsilon)-synchrone et cela pour tout epsilon strictement positif;(iii) asymptotiquement gagnant si pour tout epsilon strictement positif, il existe une stratégie produisant une séquence (1-epsilon)-synchrone.Nous considérons le problème consistant à décider si un MDP est gagnant, pour chaque type de synchronisation et chaque mode gagnant: nous établissons les limites supérieures et inférieures de la complexité de ces problèmes ainsi que la capacité mémoire requise pour une stratégie gagnante optimale.En outre, nous étudions les problèmes de synchronisation pour les automates probabilistes (PAs) qui sont en fait des instances de MDP où les contrôleurs sont restreint à utiliser uniquement des stratégies-mots; c'est à dire qu'ils n'ont pas la possibilité d'observer l'historique de l'exécution du système et ne peuvent connaitre que le nombre de choix effectués jusque là. Les langages synchrones d'un PA sont donc l'ensemble des stratégies-mots synchrones: nous établissons la complexité des problèmes des langages synchrones vides et universels pour chaque mode gagnant.Nous répercutons nos résultats obtenus pour les problèmes de synchronisation sur les MDPs et PAs aux jeux tour à tour à deux joueurs ainsi qu'aux automates finis non-déterministes. En plus de nos résultats principaux, nous établissons de nouveaux résultats de complexité sur les automates finis alternants avec des alphabets à une lettre. Enfin, nous étudions plusieurs variations de synchronisation sur deux instances de systèmes infinis que sont les automates temporisés et pondérés
Markov decision processes (MDPs) are finite-state probabilistic systems with bothstrategic and random choices, hence well-established to model the interactions between a controller and its randomly responding environment.An MDP can be mathematically viewed as a one and half player stochastic game played in rounds when the controller chooses an action,and the environment chooses a successor according to a fixedprobability distribution.There are two incomparable views on the behavior of an MDP, when thestrategic choices are fixed. In the traditional view, an MDP is a generator of sequence of states, called the state-outcome; the winning condition of the player is thus expressed as a set of desired sequences of states that are visited during the game, e.g. Borel condition such as reachability.The computational complexity of related decision problems and memory requirement of winning strategies for the state-outcome conditions are well-studied.Recently, MDPs have been viewed as generators of sequences of probability distributions over states, calledthe distribution-outcome. We introduce synchronizing conditions defined on distribution-outcomes,which intuitively requires that the probability mass accumulates insome (group of) state(s), possibly in limit.A probability distribution is p-synchronizing if the probabilitymass is at least p in some state, anda sequence of probability distributions is always, eventually,weakly, or strongly p-synchronizing if respectively all, some, infinitely many, or all but finitely many distributions in the sequence are p-synchronizing.For each synchronizing mode, an MDP can be (i) sure winning if there is a strategy that produces a 1-synchronizing sequence; (ii) almost-sure winning if there is a strategy that produces a sequence that is, for all epsilon > 0, a (1-epsilon)-synchronizing sequence; (iii) limit-sure winning if for all epsilon > 0, there is a strategy that produces a (1-epsilon)-synchronizing sequence.We consider the problem of deciding whether an MDP is winning, for each synchronizing and winning mode: we establish matching upper and lower complexity bounds of the problems, as well as the memory requirementfor optimal winning strategies.As a further contribution, we study synchronization in probabilistic automata (PAs), that are kind of MDPs where controllers are restricted to use only word-strategies; i.e. no ability to observe the history of the system execution, but the number of choices made so far.The synchronizing languages of a PA is then the set of all synchronizing word-strategies: we establish the computational complexity of theemptiness and universality problems for all synchronizing languages in all winning modes.We carry over results for synchronizing problems from MDPs and PAs to two-player turn-based games and non-deterministic finite state automata. Along with the main results, we establish new complexity results foralternating finite automata over a one-letter alphabet.In addition, we study different variants of synchronization for timed andweighted automata, as two instances of infinite-state systems
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Weidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.

Повний текст джерела
Анотація:
The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking. Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obtain a probabilistic MSO logic by adding an expected second order quantifier. In the scope of this quantifier, membership is determined by a Bernoulli process. This approach turns out to be universal and is applicable for finite and infinite words as well as for finite trees. In order to prove the expressive equivalence of this probabilistic MSO logic to probabilistic automata, we show a Nivat-theorem, which decomposes a recognisable function into a regular language, homomorphisms, and a probability measure. For regular expressions, we build upon existing work to obtain probabilistic regular expressions on finite and infinite words. We show the expressive equivalence between these expressions and probabilistic Muller-automata. To handle Muller-acceptance conditions, we give a new construction from probabilistic regular expressions to Muller-automata. Concerning finite trees, we define probabilistic regular tree expressions using a new iteration operator, called infinity-iteration. Again, we show that these expressions are expressively equivalent to probabilistic tree automata. On a second track of our research we investigate Constraint LTL over multidimensional data words with data values from the infinite tree. Such LTL formulas are evaluated over infinite words, where every position possesses several data values from the infinite tree. Within Constraint LTL on can compare these values from different positions. We show that the model checking problem for this logic is PSPACE-complete via investigating the emptiness problem of Constraint Büchi automata.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Louis, Pierre-Yves. "Increasing coupling for probabilistic cellular automata." Universität Potsdam, 2005. http://opus.kobv.de/ubp/volltexte/2006/659/.

Повний текст джерела
Анотація:
We give a necessary and sufficient condition for the existence of an increasing coupling of N (N >= 2) synchronous dynamics on S-Zd (PCA). Increasing means the coupling preserves stochastic ordering. We first present our main construction theorem in the case where S is totally ordered; applications to attractive PCAs are given. When S is only partially ordered, we show on two examples that a coupling of more than two synchronous dynamics may not exist. We also prove an extension of our main result for a particular class of partially ordered spaces.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Khapko, Taras. "Edge states and transition to turbulence in boundary layers." Doctoral thesis, KTH, Stabilitet, Transition, Kontroll, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186038.

Повний текст джерела
Анотація:
The focus of this thesis is the numerical study of subcritical transition to turbulence in boundary-layer flows. For the most part, boundary layers with uniform suction are considered. Constant homogeneous suction counteracts the spatial growth of the boundary layer, rendering the flow parallel. This enables research approaches which are not feasible in the context of spatially developing flows. In the first part, the laminar–turbulent separatrix of the asymptotic suction boundary layer (ASBL) is investigated numerically by means of an edge-tracking algorithm. The obtained edge states experience recurrent dynamics, going through calm and bursting phases. The self-sustaining mechanism bears many similarities with the classical regeneration cycle of near-wall turbulence. The recurrent simple structure active during calm phases is compared to the nucleation of turbulence events in bypass transition originating from delocalised initial conditions. The implications on the understanding of the bypass-transition process and the edge state's role are discussed. Based on this understanding, a model is constructed which predicts the position of the nucleation of turbulent spots during free-stream turbulence induced transition in spatially developing boundary-layer flow. This model is used together with a probabilistic cellular automaton (PCA), which captures the spatial spreading of the spots, correctly reproducing the main statistical characteristics of the transition process. The last part of the thesis is concerned with the spatio-temporal aspects of turbulent ASBL in extended numerical domains near the onset of sustained turbulence. The different behaviour observed in ASBL, i.e. absence of sustained laminar–turbulent patterns, which have been reported in other wall-bounded flows, is associated with different character of the large-scale flow. In addition, an accurate quantitative estimate for the lowest Reynolds number with sustained turbulence is obtained

QC 20160429

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

Kelmendi, Edon. "Two-Player Stochastic Games with Perfect and Zero Information." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0238/document.

Повний текст джерела
Анотація:
On considère des jeux stochastiques joués sur un graphe fini. La première partie s’intéresse aux jeux stochastiques à deux joueurs et information parfaite. Dans de tels jeux, les joueurs choisissent des actions dans ensemble fini, tour à tour, pour une durée infinie, produisant une histoire infinie. Le but du jeu est donné par une fonction d’utilité qui associe un réel à chaque histoire, la fonction est bornée et Borel-mesurable. Le premier joueur veut maximiser l’utilité espérée, et le deuxième joueur veut la minimiser. On démontre que si la fonction d’utilité est à la fois shift-invariant et submixing alors le jeu est semi-positionnel. C’est-à-dire le premier joueur a une stratégie optimale qui est déterministe et sans mémoire. Les deux joueurs ont information parfaite: ils choisissent leurs actions en ayant une connaissance parfaite de toute l’histoire. Dans la deuxième partie, on étudie des jeux de durée fini où le joueur protagoniste a zéro information. C’est-à-dire qu’il ne reçoit aucune information sur le déroulement du jeu, par conséquent sa stratégie est un mot fini sur l’ensemble des actions. Un automates probabiliste peut être considéré comme un tel jeu qui a un seul joueur. Tout d’abord, on compare deux classes d’automates probabilistes pour lesquelles le problème de valeur 1 est décidable: les automates leaktight et les automates simples. On prouve que la classe des automates simples est un sous-ensemble strict de la classe des automates leaktight. Puis, on considère des jeux semi-aveugles, qui sont des jeux à deux joueurs où le maximiseur a zéro information, et le minimiseur est parfaitement informé. On définit la classe des jeux semi-aveugles leaktight et on montre que le problème d’accessibilité maxmin est décidable sur cette classe
We consider stochastic games that are played on finite graphs. The subject of the first part are two-player stochastic games with perfect information. In such games the two players take turns choosing actions from a finite set, for an infinite duration, resulting in an infinite play. The objective of the game is given by a Borel-measurable and bounded payoff function that maps infinite plays to real numbers. The first player wants to maximize the expected payoff, and the second player has the opposite objective, that of minimizing the expected payoff. We prove that if the payoff function is both shift-invariant and submixing then the game is half-positional. This means that the first player has an optimal strategy that is at the same time pure and memoryless. Both players have perfect information, so the actions are chosen based on the whole history. In the second part we study finite-duration games where the protagonist player has zero information. That is, he gets no feedback from the game and consequently his strategy is a finite word over the set of actions. Probabilistic finite automata can be seen as an example of such a game that has only a single player. First we compare two classes of probabilistic automata: leaktight automata and simple automata, for which the value 1 problem is known to be decidable. We prove that simple automata are a strict subset of leaktight automata. Then we consider half-blind games, which are two player games where the maximizer has zero information and the minimizer is perfectly informed. We define the class of leaktight half-blind games and prove that it has a decidable maxmin reachability problem
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Coore, Daniel. "Automatic profiler-driven probabilistic compiler optimization." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35396.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Probabilistic automaton"

1

Louis, Pierre-Yves, and Francesca R. Nardi, eds. Probabilistic Cellular Automata. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-65558-1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Osnovy teorii veroi͡a︡tnostnykh avtomatov. Moskva: "Nauka," Glav. red. fiziko-matematicheskoĭ lit-ry, 1985.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Lee, Won Don. Probabilistic inference. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Gevarter, William B. Automatic probabilistic knowledge acquisition from data. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Lee, Won Don. Probabilistic inference: Theory and practice. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1986.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Sturm, Jürgen. Approaches to Probabilistic Model Learning for Mobile Manipulation Robots. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

European Congress on Intelligent Techniques and Soft Computing (5th 1997 Aachen, Germany). EUFIT '97: 5th European Congress on Intelligent Techniques and Soft Computing : Aachen, Germany , September 8-11, 1997, proceedings. Aachen: Verlag Mainz [for the] ELITE-Foundation, 1997.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

European Congress on Fuzzy and Intelligent Technologies. (1st 1993 Aachen, Germany). EUFIT '93: First European congress on fuzzy and intelligent technologies : September 7-10, 1993, Eurogress Aachen, Germany : Proceedings. Aachen: Verlag der Augustinus Buchhandlung for the ELITE-Foundation, 1993.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Probabilistic Cellular Automata: Theory, Applications and Future Perspectives. Springer, 2019.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Goldreich, Oded. Probabilistic Proof Systems: A Primer. Now Publishers, 2008.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "Probabilistic automaton"

1

Bagnoli, Franco, and Raúl Rechtman. "Regional Synchronization of a Probabilistic Cellular Automaton." In Developments in Language Theory, 255–63. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-99813-8_23.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Livi, R., and S. Ruffo. "Probabilistic Cellular Automaton Models for a Fluid Experiment." In New Trends in Nonlinear Dynamics and Pattern-Forming Phenomena, 237–39. New York, NY: Springer US, 1990. http://dx.doi.org/10.1007/978-1-4684-7479-4_32.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Dupont, Pierre, and Lin Chase. "Using symbol clustering to improve probabilistic automaton inference." In Grammatical Inference, 232–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054079.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Ohta, Manabu, Atsuhiro Takasu, and Jun Adachi. "Probabilistic Automaton Model for Fuzzy English-Text Retrieval." In Research and Advanced Technology for Digital Libraries, 35–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45268-0_4.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Bagnoli, Franco, Fabio Franci, and Raúl Rechtman. "Opinion Formation and Phase Transitions in a Probabilistic Cellular Automaton with Two Absorbing States." In Lecture Notes in Computer Science, 249–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45830-1_24.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Etessami, Kousha. "Analysis of probabilistic processes and automata theory." In Handbook of Automata Theory, 1343–82. Zuerich, Switzerland: European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/36.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Raabe, Dierk, and Richard C. Becker. "Coupling of a Crystal Plasticity Finite Element Model with a Probabilistic Cellular Automaton for Simulating Primary Static Recrystallization in Aluminum." In Microstructures, Mechanical Properties and Processes - Computer Simulation and Modelling, 1–8. Weinheim, FRG: Wiley-VCH Verlag GmbH & Co. KGaA, 2005. http://dx.doi.org/10.1002/3527606157.ch1.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Weidner, Thomas. "Probabilistic Automata and Probabilistic Logic." In Mathematical Foundations of Computer Science 2012, 813–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32589-2_70.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Segala, Roberto. "Testing probabilistic automata." In CONCUR '96: Concurrency Theory, 299–314. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61604-7_62.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Huberman, B. A. "Probabilistic Cellular Automata." In Springer Proceedings in Physics, 129–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-93289-2_5.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Probabilistic automaton"

1

Rezagholizadeh, Mehdi, Pouya Mehrannia, Asiyeh Barzegar, Alireza Fereidunian, Behzad Moshiri, and Hamid Lesani. "A probabilistic partial order theory approach to IT infrastructure selection for Smart Grid." In 2013 13th International Conference on Control, Automaton and Systems (ICCAS 2013). IEEE, 2013. http://dx.doi.org/10.1109/iccas.2013.6703983.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Liu, Zhao, Huan Zhang, Taide Tan, Changxiong Qin, and Jing Fan. "A Cellular Automaton Model and its Application on Emotional Infections." In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-36136.

Повний текст джерела
Анотація:
Emotional contagion has been a focus problem in the current fields of psychology and organizational behavior. Based on the theoretical analysis of the emotional contagion mechanisms and probabilistic theory, a cellular automaton (CA) model has been proposed to simulate the process of emotional contagion. And with the help of this CA model, we study the gross features of employees’ positive emotions in the evolution of emotional contagion and explore the effects of employees’ ability to transport emotion susceptibility and intimacy on the reaction process. The results indicate that employees’ ability to transport positive emotion susceptibility and intimacy are positive related to the emotional contagion between employees.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Asami, Atsushi, Tatsuki Yamada, and Yohei Saika. "Probabilistic inference of environmental factors via time series analysis using mean-field theory of ising model." In 2013 13th International Conference on Control, Automaton and Systems (ICCAS). IEEE, 2013. http://dx.doi.org/10.1109/iccas.2013.6704168.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Rataj, Artur. "From a model-based robotic application to a probabilistic timed automaton with only C/C++ development." In ROSCon2019FR. Mountain View, CA: Open Robotics, 2019. http://dx.doi.org/10.36288/roscon2019fr-900323.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Rataj, Artur. "From a model-based robotic application to a probabilistic timed automaton with only C/C++ development." In ROSCon2019FR. Mountain View, CA: Open Robotics, 2019. http://dx.doi.org/10.36288/roscon2019fr-900867.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Wu, Zhenhua, and Sheng-Jen Hsieh. "Design and Validation of Fault Diagnoser Based on Finite State Automaton and Sequential Function Chart for PLC Based Manufacturing System." In ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7159.

Повний текст джерела
Анотація:
In ISFA-2010, we proposed a fault diagnoser design based on finite state automaton and sequential function chart to diagnose programmable logic controller (PLC) based manufacturing systems. A deficiency for that paper is that it only laid down a theoretical framework but lacking a detailed implementation and experiment validation. This paper aims at remedying the deficiency with detailed system design to diagnose discrete event system (DES) faults. Systematic diagnosis approach including modeling the plant, mapping output states with sensor readings, and designing diagnoser, was illustrated in this paper. The proposed diagnoser was implemented using Visual Basic to diagnose typical faults a PLC controlled dual robot arm. Experiment validation illustrated that the proposed diagnoser can detect and isolate DES equipment faults with a high fault detection rate of 93%, and detection rate of 80% when including product tolerance fault. The proposed diagnoser can achieve maximum fault detection delay of 9 seconds on the equipment faults. For the future direction, we are planning to extend the proposed diagnoser design to detect probabilistic faults in PLC based automated systems.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Osawa, Naoki, Yasuhide Kanou, Yasumi Kawamura, Atsushi Takada, Kazuhiko Shiotani, Seiru Takeno, Shino Katayama, and Kristov Ivan William. "Development of Under-Film Corrosion Simulation Method Based on Cellular Automaton." In ASME 2016 35th International Conference on Ocean, Offshore and Arctic Engineering. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/omae2016-54508.

Повний текст джерела
Анотація:
A simulation method for under-film corrosion has been developed for epoxy coated steel panels within a ship’s Water Ballast Tank (WBT) environment. The incubation and extension of coating failure is simulated by using two-dimensional cellular automaton, and the steel diminution is simulated by modifying IACS CSR-H’s 3-phases probabilistic model. Analysis parameters are determined by using the results of onboard exposure and cyclic corrosion tests performed by Shiotani et al. (2012, 2015). The change in corroded surface shape of epoxy coated scribed steel panels made of conventional steel and corrosion resistant steel (CRS) exposed in an ore carrier’s WBT for 4.8 years is simulated. The simulated coating deterioration (blister) area and the corroded surface profile agree well with those measured. This demonstrates the effectiveness of the developed simulation method and the determined parameters. The differences in analysis parameters between conventional steel and CRS suggest that CRS can reduce the harmful effect of the active corrosion region on the remaining coating life at the blister’s frontline and the corrosion under the blister.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Hahn, Ernst Moritz, and Holger Hermanns. "Rewarding probabilistic hybrid automata." In the 16th international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2461328.2461375.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Lu, Lu, and Jianhui Yu. "Analysis of Automatic Depressurization System Stage 4 Valves Inadvertent Actuation Scenario for a Certain Passive Power Plant." In 2013 21st International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/icone21-15841.

Повний текст джерела
Анотація:
The automatic depressurization system (ADS) stage 4 valves inadvertent actuation scenario is one of the risk-significant cases in probabilistic risk assessment (PRA) analysis of passive power plant. Based on mini-ASTRUM (automated statistical treatment of uncertainty method) and CQD (code qualification document) method together, the calculation which utilizing WCOBRA/TRAC and HOTSPOT codes has been made in this paper. And the results indicate that, the calculated peak cladding temperature (PCT), local maximum oxidation (LMO), and core-wide oxidation (CWO) are all low enough, which meet the three design acceptance criteria defined in 10 CFR 50.46 emergency core cooling system (ECCS).
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Vatan, Farrokh. "Distribution functions of probabilistic automata." In the thirty-third annual ACM symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/380752.380872.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Probabilistic automaton"

1

Cortes, Corinna, Mehryar Mohri, Ashish Rastogi, and Michael Riles. On the Computation of the Relative Entropy of Probabilistic Automata. Fort Belvoir, VA: Defense Technical Information Center, January 2007. http://dx.doi.org/10.21236/ada606160.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Smolka, Scott A. Semantic Theories and Automated Tools for Real-Time and Probabilistic Concurrent Systems. Fort Belvoir, VA: Defense Technical Information Center, May 1997. http://dx.doi.org/10.21236/ada329736.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Clark, G. A., M. E. Glinsky, K. R. S. Devi, J. H. Robinson, P. K. Z. Cheng, and G. E. Ford. Automatic event picking in pre-stack migrated gathers using a probabilistic neural network. Office of Scientific and Technical Information (OSTI), April 1996. http://dx.doi.org/10.2172/394450.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sanderson, Dylan, and Mark Gravens. Representative Storm Selection Tool : an automated procedure for the selection of representative storm events from a probabilistic database. Coastal and Hydraulics Laboratory (U.S.), May 2018. http://dx.doi.org/10.21079/11681/26829.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Probabilistic automaton" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії