reachability 中文意思是什麼

reachability 解釋
可存取性
  1. Php object persistent database. podb is implementing persistency by reachability approach. object of any class derived from persistent base class is considered as persistent capable

    Podb是通過可通性的途徑實現持久性的。源自持久性基類的任何類的對象都是具有持久性能力的。
  2. Then the methods using reachability graph to analyze static and dynamic structural performance of colored timed workflow net are improved, and the theorem verifying whether there are deadlocks or traps in concurrent workflow are put forward using reachability graph

    通過可達圖分析著色時間工作流網靜態和動態性能，提出用可達圖檢驗工作流中是否存在死鎖和陷阱的判斷定理。
  3. It can be used for the reachability judgement and layout rationalization of components and buttons for driving and controlling. 4. the posture recording methods, the comfort of postures and its influential factors are discussed

    利用該方法可判斷由人體模型實例所代表的使用者群體的伸及能力，檢驗操作控製件的可伸及性和布局合理性。
  4. The new model can resolve the unresolved problem such as the relation among the attack events, the model forecasting and the model preventing. we use petri net to model the new intrusion detection model, and we make the qualitative and quantitative analysis of reachability and complication degree, and then we use c + + builder 6. 0 to fulfill the model ' s reachability property and performance analysis

    本文對此時間序列模型用petrinet進行建模，對所建模型進行可達性、復雜度等性質的定性定量的分析，並且使用c + + builder6 . 0對模型的可達性性質進行了編碼實現和性能分析。
  5. Definitions of rough set state space are given. stability, reachability, consistency and completeness of this new state space model are discussed in detail, respectively

    初步討論了粗糙狀態空間模型的穩定性和可達性，提出了基於粗糙狀態空間模型的非線性過程建模和粗糙控制器設計方法。
  6. In this paper, we propose a strategy for selecting synchronization sequences from java multi - thread program based on the analyzing of reading and writing on shared variable, and implemented a deterministic testing framework of java multi - thread program by using the dynamic proxy class. a reachability testing system of java multi - thread program is constructed by the strategy and the deterministic testing framework

    本文提出了一種基於共享變量讀寫操作分析的java多線程程序同步序列生成策略，採用動態代理類proxy實現了java多線程程序確定性測試框架系統，從而實現了一個java多線程可達性測試系統。
  7. This paper validate the good or the bad of reachability from three point of view : firstly, putting forward reachable time and giving method that resolve the reachable time, the reachable time validate qualitative parameters with quantitative data. secondly, validating the good or the bad of reachability from view reachability, putting forward validation method of view reachability : validation method of relatively position and validation method of field of view and giving compute aided validation flow ; thirdly, validating the good or bad of rachability from space reachability, researching compute aided validation rule and contents and flow of task space. lastly, taking the group of wheel of the main undercarriage for example, illuminating compute aided validation method

    針對可達性指標，本文從三個角度進行驗證：第一，提出可達時間的概念，給出可達時間的求解方法，從定量的角度來衡量定性指標；第二，從視覺可達的角度來評價可達性的好壞，提出視覺可達性的驗證方法：相對位置驗證法和視野內切錐驗證法，並給出計算機輔助驗證流程；第三，從作業空間可達性的角度來評價可達性的好壞，研究了作業空間計算機輔助驗證準則、內容和驗證流程。
  8. Method extraction based on reachability tree of pr t net for horn clauses set

    網可達樹的方案求解
  9. Reachability of petri net

    網系統的可達性分析
  10. Reachability testing is a valid method for concurrent software testing

    可達性測試是並發軟體測試中的一種有效方法。
  11. Sufficient and necessary condition of controllability and reachability of a class of linear switching systems

    一類線性切換系統能控性和能達性的充要條件
  12. On the foundation of analyzing to the net system, we improve traditional reachability analysis technique, and use time petri nets with inhibitor arcs to model ieee 802. 2 llc 3 type protocol

    在對該網系統進行分析的基礎之上，發展了傳統的可達分析技術。應用帶抑止弧的時間petri網對ieee802 . 2llc3型協議進行了建模。
  13. Most of the timed automata reachability analysis algorithms in the literature explore the state spaces by enumeration of symbolic states, which use time constraints to represent a set of concrete states

    但是，隨著系統規模的擴展，狀態空間的大小呈現爆炸性的增長，往往超出了當前計算機的能力極限。這被稱為「狀態空間爆炸問題」 。
  14. For quantitative solution, we study gspn and find that the reachability graph of a gspn is isomorphic to a continuous time markov process ( ctmp ) when the vanishing markings are eliminated, so markov process method can be used

    在安全性定量分析方面，我們研究發現去除消失標識后， gspn的可達圖與一個連續時間markov過程（ ctmp ）是同構的，為此，可利用markov過程方法進行分析。
  15. Three necessary conditions on the parameters are derived, and then a reduced reachability graph is obtained by applying the necessary conditions to lessen the combinatorial state explosion. and these dynamic characteristics to this model are verified preliminarily using the reduced reachability graph

    根據本文提出的可達分析技術，推導出了保證協議正確操作的參數間的時間關系，根據該時間關系，我們得到了所建模型的簡化的可達標識圖，並對該模型的動態特性進行了初步分析。
  16. 2. the geometric aspect of decentralized control the decentralized controllable subspace and unobservable subspace were defined. we explore in detail the relations of these two concepts with the centralized controllable subspace and unobservable subspace respectively, and found out that the structural properties ( such as reachability ) played a key role in them

    文中充分研究了這兩個概念分別與集中控制情況下的能控子空間和不能觀測子空間之間的關系，發現大系統的結構特性（可達性）在其中起著關鍵的作用。
  17. Legal firing sequence ( lfs for short ) is a sub - problem of reachability of petri nets. it is in fact a process of verificating the executability of a n - vector of non - negative integer x. an algorithm is presented to solve lfs of bounded petri nets in the thesis

    合法引發序列是petri網可達性問題的一部分，它是petri網研究領域的一個重要研究課題，本文針對petri網的一個子類? ?有界petri網給出了一個判定合法引發序列演算法。
  18. After all, the research results on cascade petri net are an extension of the arisen petri net theory, which can not only be used for designing controllers of des, but also be used for analyzing reachability of petri nets. the supervisory control part : firstly, the existence condition of maximally permissive multi - valued logic controller for the forbidden state problem is presented

    總的說來，本論文所討論的序狀petri網理論是對已有的petri網理論的進一步發展，它不僅直接應用於本論文後續章節所討論的狀態反饋控制器的設計，而且還可以應用於任何需要分析序狀petri網可達性問題的場合。
  19. The reachability query is an important kind query on xml data, for which some query methods based on reachability code and methods with index and other structures are proposed to improve query efficiency. because the time spent on coding a graph is usually high, and these methods require large storage on disk, however, these methods are not able to deal with reachability query on large amount of data well

    為高效地回答查詢，基於可達編碼的方法被提出，並加入索引和其它輔助結構以提高效率，然而由於圖上編碼的時間復雜度太大，並且會過多地佔用搜索和存儲空間，現有基於編碼的演算法對大量數據上進行的可達查詢並不適用。
分享友人
分享到 Line

分享到臉書