Faster access than browser!
26 relations: Alternating-time temporal logic, Atomic formula, Concurrent computing, Context-free grammar, CTL*, De Morgan's laws, E. Allen Emerson, Edmund M. Clarke, Fair computational tree logic, False (logic), Formal verification, Jan van Leeuwen, Linear temporal logic, Liveness, Logical connective, Logical consequence, Mathematical logic, Modal μ-calculus, Model checking, Probabilistic CTL, Regular language, Safety property, Temporal logic, Transition system, Truth, Well-formed formula.
Alternating-time temporal logic
In computer science, alternating-time temporal logic, or ATL, is a branching-time temporal logic that naturally describes computations of multi-agent system and multiplayer games.
New!!: Computation tree logic and Alternating-time temporal logic · See more »
Atomic formula
In mathematical logic, an atomic formula (also known simply as an atom) is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformulas.
New!!: Computation tree logic and Atomic formula · See more »
Concurrent computing
Concurrent computing is a form of computing in which several computations are executed during overlapping time periods—concurrently—instead of sequentially (one completing before the next starts).
New!!: Computation tree logic and Concurrent computing · See more »
Context-free grammar
In formal language theory, a context-free grammar (CFG) is a certain type of formal grammar: a set of production rules that describe all possible strings in a given formal language.
New!!: Computation tree logic and Context-free grammar · See more »
CTL*
CTL* is a superset of computational tree logic (CTL) and linear temporal logic (LTL).
New!!: Computation tree logic and CTL* · See more »
De Morgan's laws
In propositional logic and boolean algebra, De Morgan's laws are a pair of transformation rules that are both valid rules of inference.
New!!: Computation tree logic and De Morgan's laws · See more »
E. Allen Emerson
Ernest Allen Emerson (born June 2, 1954) is a computer scientist and endowed professor at the University of Texas, Austin, United States.
New!!: Computation tree logic and E. Allen Emerson · See more »
Edmund M. Clarke
Edmund Melson Clarke, Jr. (born July 27, 1945) is an American retired computer scientist and academic noted for developing model checking, a method for formally verifying hardware and software designs.
New!!: Computation tree logic and Edmund M. Clarke · See more »
Fair computational tree logic
Fair computational tree logic is conventional computational tree logic studied with explicit fairness constraints.
New!!: Computation tree logic and Fair computational tree logic · See more »
False (logic)
In logic, false or untrue is the state of possessing negative truth value or a nullary logical connective.
New!!: Computation tree logic and False (logic) · See more »
Formal verification
In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics.
New!!: Computation tree logic and Formal verification · See more »
Jan van Leeuwen
Jan van Leeuwen (born December 17, 1946 in Waddinxveen) is a Dutch computer scientist and Emeritus professor of computer science at the Department of Information and Computing Sciences at Utrecht University.
New!!: Computation tree logic and Jan van Leeuwen · See more »
Linear temporal logic
In logic, linear temporal logic or linear-time temporal logic (LTL) is a modal temporal logic with modalities referring to time.
New!!: Computation tree logic and Linear temporal logic · See more »
Liveness
In concurrent computing, liveness refers to a set of properties of concurrent systems, that require a system to make progress despite the fact that its concurrently executing components ("processes") may have to "take turns" in critical sections, parts of the program that cannot be simultaneously run by multiple processes.
New!!: Computation tree logic and Liveness · See more »
Logical connective
In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a symbol or word used to connect two or more sentences (of either a formal or a natural language) in a grammatically valid way, such that the value of the compound sentence produced depends only on that of the original sentences and on the meaning of the connective.
New!!: Computation tree logic and Logical connective · See more »
Logical consequence
Logical consequence (also entailment) is a fundamental concept in logic, which describes the relationship between statements that hold true when one statement logically follows from one or more statements.
New!!: Computation tree logic and Logical consequence · See more »
Mathematical logic
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics.
New!!: Computation tree logic and Mathematical logic · See more »
Modal μ-calculus
In theoretical computer science, the modal μ-calculus (Lμ, Lμ, sometimes just μ-calculus, although this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding the least fixed point operator μ and the greatest fixed point operator \nu, thus a fixed-point logic.
New!!: Computation tree logic and Modal μ-calculus · See more »
Model checking
In computer science, model checking or property checking refers to the following problem: Given a model of a system, exhaustively and automatically check whether this model meets a given specification.
New!!: Computation tree logic and Model checking · See more »
Probabilistic CTL
Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) which allows for probabilistic quantification of described properties.
New!!: Computation tree logic and Probabilistic CTL · See more »
Regular language
In theoretical computer science and formal language theory, a regular language (also called a rational language) is a formal language that can be expressed using a regular expression, in the strict sense of the latter notion used in theoretical computer science (as opposed to many regular expressions engines provided by modern programming languages, which are augmented with features that allow recognition of languages that cannot be expressed by a classic regular expression).
New!!: Computation tree logic and Regular language · See more »
Safety property
In distributed computing, safety properties informally require that "something bad will never happen" in a distributed system or distributed algorithm.
New!!: Computation tree logic and Safety property · See more »
Temporal logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time.
New!!: Computation tree logic and Temporal logic · See more »
Transition system
In theoretical computer science, a transition system is a concept used in the study of computation.
New!!: Computation tree logic and Transition system · See more »
Truth
Truth is most often used to mean being in accord with fact or reality, or fidelity to an original or standard.
New!!: Computation tree logic and Truth · See more »
Well-formed formula
In mathematical logic, propositional logic and predicate logic, a well-formed formula, abbreviated WFF or wff, often simply formula, is a finite sequence of symbols from a given alphabet that is part of a formal language.
New!!: Computation tree logic and Well-formed formula · See more »
Redirects here:
CTL (logic), Computational tree logic.
References
[1] https://en.wikipedia.org/wiki/Computation_tree_logic
