Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Computation_tree_logic> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- Computation_tree_logic abstract "Computation 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 realized. 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. For example, CTL can specify that when some initial condition is satisfied (e.g., all program variables are positive or no cars on a highway straddle two lanes), then all possible executions of a program avoid some undesirable condition (e.g., dividing a number by zero or two cars colliding on a highway). In this example, the safety property could be verified by a model checker that explores all possible transitions out of program states satisfying the initial condition and ensures that all such executions satisfy the property. Computation tree logic is in a class of temporal logics that includes linear temporal logic (LTL). Although there are properties expressible in only one of CTL and LTL, all properties expressible in either logic can also be expressed in CTL*.".
- Computation_tree_logic wikiPageExternalLink slide4.pdf.
- Computation_tree_logic wikiPageID "840894".
- Computation_tree_logic wikiPageRevisionID "605928475".
- Computation_tree_logic hasPhotoCollection Computation_tree_logic.
- Computation_tree_logic subject Category:Automata_theory.
- Computation_tree_logic subject Category:Logic_in_computer_science.
- Computation_tree_logic subject Category:Temporal_logic.
- Computation_tree_logic comment "Computation 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 realized. 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.".
- Computation_tree_logic label "Computation Tree Logic".
- Computation_tree_logic label "Computation tree logic".
- Computation_tree_logic label "計算木論理".
- Computation_tree_logic sameAs Computation_Tree_Logic.
- Computation_tree_logic sameAs Λογική_υπολογιστικού_δένδρου.
- Computation_tree_logic sameAs 計算木論理.
- Computation_tree_logic sameAs 계산_트리_논리.
- Computation_tree_logic sameAs m.03g1fn.
- Computation_tree_logic sameAs Q1040040.
- Computation_tree_logic sameAs Q1040040.
- Computation_tree_logic wasDerivedFrom Computation_tree_logic?oldid=605928475.
- Computation_tree_logic isPrimaryTopicOf Computation_tree_logic.