infinite automaton 中文意思是什麼

infinite automaton 解釋
無限自動機, 無窮自動機
  • infinite : adj (opp finite)1 無限的,無窮的,廣大無邊的。2 無數的,許許多多的。3 【語法】非限定的,不受人...
  • automaton : n. (pl. automatons, -ta )1. 自動物;自動玩具;自動開關;自動裝置。2. 機械式工作的人。
  1. 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

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