計算木論理
1. Computation tree logicComputation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realised. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers which determine if a given artifact possesses safety or liveness properties.
Read “Computation tree logic” on English Wikipedia
Read “計算木論理” on Japanese Wikipedia
Read “Computation tree logic” on DBpedia
Read “Computation tree logic” on English Wikipedia
Read “計算木論理” on Japanese Wikipedia
Read “Computation tree logic” on DBpedia
Discussions
Log in to talk about this word.