branching-time temporal logic CTL*
E384578
branching-time temporal logic
formal specification language
formal verification formalism
modal logic
temporal logic
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
All labels observed (5)
| Label | Occurrences |
|---|---|
| CTL* is strictly more expressive than both CTL and LTL | 1 |
| Computation Tree Logic * | 1 |
| Computation Tree Logic star | 1 |
| branching-time temporal logic CTL* canonical | 1 |
| computation tree logic | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T3748630 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: branching-time temporal logic CTL* Context triple: [E. Allen Emerson, notableWork, branching-time temporal logic CTL*]
-
A.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
B.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
C.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
D.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
E.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: branching-time temporal logic CTL* Target entity description: Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
-
A.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
B.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
C.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
D.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
E.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
branching-time temporal logic
ⓘ
formal specification language ⓘ formal verification formalism ⓘ modal logic ⓘ temporal logic ⓘ |
| comparedTo |
CTL
ⓘ
LTL ⓘ |
| expressivenessRelation |
branching-time temporal logic CTL*
self-linksurface differs
ⓘ
surface form:
CTL* is strictly more expressive than both CTL and LTL
|
| field |
computer science
ⓘ
formal methods ⓘ logic in computer science ⓘ |
| fullName |
branching-time temporal logic CTL*
self-linksurface differs
ⓘ
surface form:
Computation Tree Logic *
|
| hasFragment |
CTL
ⓘ
LTL ⓘ |
| hasPathQuantifier |
A
ⓘ
E ⓘ |
| hasProperty |
branching-time semantics
ⓘ
can express both safety and liveness properties ⓘ can express fairness constraints ⓘ highly expressive ⓘ path quantifiers and temporal operators can be arbitrarily nested ⓘ strictly more expressive than CTL ⓘ subsumes CTL ⓘ subsumes LTL ⓘ |
| hasTemporalOperator |
F
ⓘ
G ⓘ U ⓘ X ⓘ |
| introducedInContextOf | model checking ⓘ |
| logicType | branching-time temporal logic ⓘ |
| modelCheckingComplexity | PSPACE-complete for state formulas ⓘ |
| quantifiesOver | computation paths in a transition system ⓘ |
| relatedLogic | µ-calculus ⓘ |
| satisfiabilityComplexity | 2EXPTIME-complete ⓘ |
| semanticsDefinedOver |
Kripke structures
ⓘ
branching-time models ⓘ |
| syntaxFeature |
allows arbitrary nesting of path and temporal operators
ⓘ
distinguishes between state formulas and path formulas ⓘ |
| typicalModelCheckingInput |
CTL* formula
ⓘ
finite-state transition system ⓘ |
| usedFor |
model checking
ⓘ
reasoning about branching time structures ⓘ specifying properties of concurrent systems ⓘ specifying properties of reactive systems ⓘ verification of hardware systems ⓘ verification of software systems ⓘ |
| usedIn |
verification of communication protocols
ⓘ
verification of distributed algorithms ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: branching-time temporal logic CTL* Description of subject: Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.
this entity surface form:
computation tree logic
branching-time temporal logic CTL*
→
fullName
→
branching-time temporal logic CTL*
self-linksurface differs
ⓘ
subject surface form:
CTL*
this entity surface form:
Computation Tree Logic *
branching-time temporal logic CTL*
→
expressivenessRelation
→
branching-time temporal logic CTL*
self-linksurface differs
ⓘ
subject surface form:
CTL*
this entity surface form:
CTL* is strictly more expressive than both CTL and LTL
this entity surface form:
Computation Tree Logic star