automata automaton 中文意思是什麼
automata automaton
解釋
的復數-
Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata
摘要盡管鄰接矩陣是有窮自動機的一種常用存儲方法，但是，鄰接矩陣並不適合存儲所有類型的有窮自動機。 -
Based on this classification, some important types of fuzzy finite automaton are classified. in the meantime, the relations among these fuzzy finite automata in same models are obtained
同時，在新分類中，在同一類型中的各種原模糊有限自動機類型之間的等價或從屬關系被證明和獲得。 -
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
一個被廣泛用於驗證實時系統的方法是根據被驗證的實時性質，使用適當的雙向模擬等價關系使無限的狀態空間轉化為有限的狀態等價類空間.演算法只需要在這個有限的等價類空間里搜索就可以得到正確答案.但是，這個等價類空間的規模一般隨著系統規模的增大而產生爆炸性的增長，以至於在很多情況下，窮盡搜索這個空間是不現實的.該文引入了一個等價關系來驗證一個由多個實時自動機通過共享變量組成的並發系統是否滿足一個線性時段特性.同時，還引入了格局之間的兼容關系來避免對狀態等價類空間的窮盡搜索.基於這兩個關系，文章提出了一個演算法來驗證是否一個實時自動機網滿足一個線性時段特性.實例研究顯示，此演算法在某些情況下比其他一些工具有更好的時間和空間效率 -
In this thesis, we study the non - invertible linear finite autonomous automata and derive the following new results : 1. a formula is given to count the number of the nodes of every level in a down - oriented tree of an autonomous automaton. then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact - equibranch down - oriented tree [ theorem 3. 2 - 3. 3 ]
本文研究了布爾代數上非可逆的線性內動機，取得了下列成果： （ 1 ）給出了線性內動機下向樹形中每一層節點的計數公式和下向樹是等叉下向樹形的判定條件[定理3 . 2 3 . 3 ] 。 -
As a special case of lattice - valued finite state automata, mizumoto fuzzy finite state automaton is considred. furthermore, we obtain a minimization algorithm of mizumoto fuzzy automata. we obtain our results mainly by compare and contrast, analysis and synthesis, induction and reduction to absurdity
此外，本文對格值有限狀態自動機的一種特殊類型? ? mizumoto型模糊有限狀態自動機的狀態最小化約簡問題也作了一些探討，給出了mizumoto型模糊有限狀態自動機的一種狀態最小化約簡演算法。 -
After - transforming the labeled transition system of operational semantics and linear temporal logic formula into btlchi automata respectively, the correctness of uml statecharts can be verified using automaton - based model checking method
在把根據eha操作語義得到的標記遷移系統和表示性質的線性時態邏輯公式分別轉換為b chi自動機后，用基於自動機理論的模型檢驗方法驗證umlstatecharts的正確性。
分享友人