About: Computation tree logic

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Computation tree logic Goto Sponge Distinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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

Attributes	Values
rdfs:label	Computation tree logic (en)
rdfs: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. 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 (en)
sameAs	Computation tree logic
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:More_footnotes dbt:Reflist
Subject	Automata (computation) Temporal logic Logic in computer science
Link from a Wikipage to an external page	https://www.cs.cmu.edu/afs/cs/user/emc/www/papers/Invited%20Conference%20Articles/Design%20and%20Synthesis%20of%20Synchronization%20Skeletons%20Using%20Branching%20Time%20Temporal%20Logic.pdf http://www.inf.unibz.it/~artale/FM/slide4.pdf
gold:hypernym	Logic
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Computation_tree_logic?oldid=1027798694&ns=0
Wikipage page ID	840894 (xsd:integer)
page length (characters) of wiki page	17531 (xsd:nonNegativeInteger)
Wikipage revision ID	1027798694 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal verification Liveness Logical connective Logical consequence Probabilistic CTL Undecidable problem Well-formed formula Alternating-time temporal logic Atomic formula Safety property CTL* Automata (computation) Temporal logic Logic in computer science PSPACE-complete De Morgan's laws Linear temporal logic Temporal logic Time Honesty Concurrent computing Context-free grammar E. Allen Emerson Edmund M. Clarke First-order logic Graph Fair computational tree logic False (logic) Modal μ-calculus Model checking Monadic second-order logic Transition system Tree (graph theory) Mathematical logic Regular language
has 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 belongs to a class of temporal logics that includes linear temporal logic (LTL). Although there are properties expressible only in CTL and properties expressible only in LTL, all properties expressible in either logic can also be expressed in CTL*. CTL was first proposed by Edmund M. Clarke and E. Allen Emerson in 1981, who used it to synthesize so-called synchronisation skeletons, i.e abstractions of concurrent programs. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Computation_tree_logic
is Wikipage redirect of	CTL (logic) Computational tree logic
is Link from a Wikipage to another Wikipage of	Formal verification List of terms relating to algorithms and data structures NuSMV 2-EXPTIME Abstract model checking Alternating-time temporal logic Belief–desire–intention software model CTL CTL* Linear temporal logic Linear time property List of model checking tools Concurrency (computer science) Construction and Analysis of Distributed Processes List of computing and IT abbreviations Fair computational tree logic Infer Static Analyzer Kripke structure (model checking) Modal logic Modal μ-calculus Model checking CTL (logic) Computational tree logic
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Computation_tree_logic

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 925 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software