Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Computation_tree_logic> ?p ?o }
Showing triples 1 to 67 of
67
with 100 triples 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 wikiPageLength "15396".
- Computation_tree_logic wikiPageOutDegree "38".
- Computation_tree_logic wikiPageRevisionID "670243437".
- Computation_tree_logic wikiPageWikiLink Alternating-time_Temporal_Logic.
- Computation_tree_logic wikiPageWikiLink Atomic_formula.
- Computation_tree_logic wikiPageWikiLink CTL*.
- Computation_tree_logic wikiPageWikiLink Category:Automata_theory.
- Computation_tree_logic wikiPageWikiLink Category:Logic_in_computer_science.
- Computation_tree_logic wikiPageWikiLink Category:Temporal_logic.
- Computation_tree_logic wikiPageWikiLink Context-free_grammar.
- Computation_tree_logic wikiPageWikiLink De_Morgans_Laws.
- Computation_tree_logic wikiPageWikiLink De_Morgans_laws.
- Computation_tree_logic wikiPageWikiLink Entailment.
- Computation_tree_logic wikiPageWikiLink Fair_Computational_tree_logic.
- Computation_tree_logic wikiPageWikiLink Fair_computational_tree_logic.
- Computation_tree_logic wikiPageWikiLink False_(logic).
- Computation_tree_logic wikiPageWikiLink First-order_logic.
- Computation_tree_logic wikiPageWikiLink Formal_verification.
- Computation_tree_logic wikiPageWikiLink Jan_van_Leeuwen.
- Computation_tree_logic wikiPageWikiLink Linear_temporal_logic.
- Computation_tree_logic wikiPageWikiLink Liveness.
- Computation_tree_logic wikiPageWikiLink Logical_connective.
- Computation_tree_logic wikiPageWikiLink Logical_consequence.
- Computation_tree_logic wikiPageWikiLink Logical_operator.
- Computation_tree_logic wikiPageWikiLink Mathematical_logic.
- Computation_tree_logic wikiPageWikiLink Modal_mu_calculus.
- Computation_tree_logic wikiPageWikiLink Modal_μ-calculus.
- Computation_tree_logic wikiPageWikiLink Model_checker.
- Computation_tree_logic wikiPageWikiLink Model_checking.
- Computation_tree_logic wikiPageWikiLink Probabilistic_CTL.
- Computation_tree_logic wikiPageWikiLink Regular_Language.
- Computation_tree_logic wikiPageWikiLink Regular_language.
- Computation_tree_logic wikiPageWikiLink Safety_(distributed_computing).
- Computation_tree_logic wikiPageWikiLink Structural_induction.
- Computation_tree_logic wikiPageWikiLink Temporal_logic.
- Computation_tree_logic wikiPageWikiLink Transition_system.
- Computation_tree_logic wikiPageWikiLink Truth.
- Computation_tree_logic wikiPageWikiLink Well-formed_formula.
- Computation_tree_logic wikiPageWikiLink Well_formed_formula.
- Computation_tree_logic wikiPageWikiLinkText "CTL".
- Computation_tree_logic wikiPageWikiLinkText "Computation tree logic".
- Computation_tree_logic wikiPageWikiLinkText "computation tree logic".
- Computation_tree_logic wikiPageWikiLinkText "computation tree logic(branching time logic)".
- Computation_tree_logic hasPhotoCollection Computation_tree_logic.
- Computation_tree_logic wikiPageUsesTemplate Template:Cite_book.
- Computation_tree_logic wikiPageUsesTemplate Template:Cite_journal.
- 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 hypernym Logic.
- Computation_tree_logic type Language.
- Computation_tree_logic type Language.
- 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 sameAs Computation_Tree_Logic.
- Computation_tree_logic sameAs Λογική_υπολογιστικού_δένδρου.
- Computation_tree_logic sameAs 計算木論理.
- Computation_tree_logic sameAs 계산_트리_논리.
- Computation_tree_logic sameAs Lógica_de_Árvore_de_Computação.
- Computation_tree_logic sameAs m.03g1fn.
- Computation_tree_logic sameAs Q1040040.
- Computation_tree_logic sameAs Q1040040.
- Computation_tree_logic wasDerivedFrom Computation_tree_logic?oldid=670243437.
- Computation_tree_logic isPrimaryTopicOf Computation_tree_logic.