equivalence state 中文意思是什麼

equivalence state 解釋
等價狀態
  • equivalence : n. 1. 均等，相等，相當。2. 【化學】等價，化合價相當；當量。3. 等值；等量。4. （語詞的）同義；同類。5. 【數學】等勢；等效。6. 【地質學；地理學】等時代。
  • state : n 1 〈常作 S 〉國，國家；〈通例作 S 〉（美國、澳洲的）州；〈the States〉 美國。2 國務，政權，政府...
  1. From the equivalence relations, a minimal form is defined and a minimization algorithm of the mealy type of fuzzy finite automata is obtained. in chapter 3, a fuzzy finite automata with a fuzzy initial state that was first considered by m. mizumoto, j. toyota and k. tanaka in 1969 is introduced. based on the mizumoto type of fuzzy finite automata, a statewise equivalence relation is considered

    在第三章中，我們首先介紹了一類有模糊初始狀態的模糊有限自動機- mizumoto型模糊有限自動機，然後定義了兩種狀態等價和兩種模糊有限自動機等價的概念，接著證明了對于每一個mizumoto型模糊有限自動機，都存在一個與之等價的狀態最小化模糊有限自動機，並且給出了一個狀態最小化約簡演算法及其演算法終止條件。
  2. The control theory of chaotic dynamical system mainly contain learning control with distal teacher, adaptive state feedback control, sliding - mode synchronous control and passive equivalence control, with which we can realize the stable control of chaotic system

    針對連續混沌動力學系統，採用遠程學習控制、自適應狀態反饋控制和滑動模態同步控制以及等效無源控制等控制策略，實現連續混沌動力學系統的快速穩定。
  3. Based on the theory of passive system, we studied the essential conditions, by which chaotic dynamical system was equivalent to passive system. through theoretic proving, we found that using state feedback could make the passive system stable. based on passive equivalence theory, we proved that weakly minimum phase nonlinear system and minimum phase nonlinear system transformed by chaotic system having relative degree 1 could be globally asymptotically stabilized by smooth state feedback

    介紹了無源系統的基本性質及其意義，利用無源性網路理論，分析並推導了一般的混飩動力學系統等效為無源系統所必需的基本條件，從理論上證明了無源系統的可控性? ?利用簡單的狀態反饋即可實現無源系統的穩定控制，從而實現了將最小相位混飩系統及弱最小相位混」飩系統等效為無源系統，即構造混飩系統的控制器，將混飩系統配置為無源系統，實現混飩系統的穩定性控制。
  4. A widely used method for checking real - time systems is, according to the real - time property to be checked, to use a proper bi - simulation equivalence relation to convert the infinite - timed state space to a finite equivalence class space. the algorithm needs only to explore the finite space to get a correct answer. in most cases, exhaustive exploration is very difficult because the equivalence class space increases explosively when the scale of the system increases. in this paper, an equivalence relation is introduced to check whether a concurrent system, which is composed of a finite set of real - time automata, satisfies a linear duration property. to avoid exhaustive exploration, this paper also introduces a compatibility relation between timed states ( configurations ). based on these two relations, an algorithm is proposed to check whether a real - time automaton network satisfies a linear duration property. the cases study shows that under some conditions this algorithm has better efficiency than the tools in the literature

    一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質，使用適當的雙向模擬等價關系使無限的狀態空間轉化為有限的狀態等價類空間.演算法只需要在這個有限的等價類空間里搜索就可以得到正確答案.但是，這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長，以至於在很多情況下，窮盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時自動機通過共享變量組成的並發系統是否滿足一個線性時段特性.同時，還引入了格局之間的兼容關系來避免對狀態等價類空間的窮盡搜索.基於這兩個關系，文章提出了一個演算法來驗證是否一個實時自動機網滿足一個線性時段特性.實例研究顯示，此演算法在某些情況下比其他一些工具有更好的時間和空間效率
  5. Equivalence of london ' s equations and discussion about critical state bean model

    兩個方程等價性與臨界態形成動力學
分享友人
分享到 Line

分享到臉書