نتایج جستجو برای: using markov chainscellular automata hybrid model then
تعداد نتایج: 5330206 فیلتر نتایج به سال:
according to recent developments of predicting methodsin financial markets, and since the stock price is one of the mostimportant factors for investment decision-making, and its predictioncan play an important role in this field, the aim of this study is toprovide a model to predict the stock price movement with highaccuracy. accordingly, a hybrid model for predicting the stock pricemovement us...
We discuss conceptional and foundational aspects of Markov automata [22]. We place this model in the context of continuousand discrete-time Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give a detailled account of the concept of relations on distributions, and discuss how this can generalise known ...
The paper proposed an approach to study the power system voltage coordinated control using Linear Temporal Logic (LTL). First, the hybrid Automata model for power system voltage control was given, and a hierarchical coordinated voltage control framework was described in detail. In the hierarchical control structure, the high layer is the coordinated layer for global voltage control, and the low...
in this thesis, we consider a mathematical model of cancer with completely unknown parameters. we study the stability of critical points which are biologically admissible. then we consider a control on the system and introduce situations at which solutions are attracted to critical points and so the cancer disease has auto healing. the lyapunov stability method is used for estimating the un...
Linguistics and automata theory were at one time tightly knit. Very early on, finite-state processes were used by Markov [35, 27] to predict sequences of vowels and consonants in novels by Pushkin. Shannon [48] extended this idea to predict letter sequences of English words using Markov processes. While many theorems about finite-state acceptors (FSAs) and finite-state transducers (FSTs) were p...
This thesis deals with verification algorithms for inhomogeneous continuous time Markov chains (ICTMC), discrete time stochastic hybrid systems (DTSHS) and Markovian timed automata (MTA). For all of these three models we define the notions of time-bounded and time-unbounded reachability. We use time-bounded and time-unbounded reachability in order to compute the satisfiability probability of an...
Hybrid automata ooer a framework for the description of systems with both discrete and continuous components, such as digital technology embedded in an analogue environment. Traditional uses of hybrid automata express choice of transitions purely in terms of nondeterminism, abstracting potentially signiicant information concerning the relative likelihood of certain behaviours. To model such pro...
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. In support of this theory, the list of undecidable problems recently shown decidable under time-...
Many of today’s mechatronic systems – such as automobiles, automated factories or chemical plants – are a complex mixture of hardware components and embedded control software, showing both continuous (vehicle dynamics, robot motion) and discrete (software) behavior. The problems of estimating the internal discrete/continuous state and automatically devising control actions as intelligent reacti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید