TLA
E467807
TLA is a formal specification language developed by Leslie Lamport for describing and reasoning about concurrent and distributed systems using temporal logic.
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
formal specification language
ⓘ
temporal logic ⓘ |
| approach |
action-based specification
ⓘ
state-based specification ⓘ |
| basedOn | temporal logic ⓘ |
| contrastsWith |
operational specification languages
ⓘ
process algebras ⓘ |
| creatorAffiliation | Microsoft Research NERFINISHED ⓘ |
| developer | Leslie Lamport NERFINISHED ⓘ |
| emphasizes |
mathematical rigor
ⓘ
precise semantics ⓘ |
| field |
computer science
ⓘ
concurrent systems ⓘ distributed systems ⓘ formal methods ⓘ |
| fullName | Temporal Logic of Actions NERFINISHED ⓘ |
| hasExtension | TLA+ NERFINISHED ⓘ |
| hasKeyConcept |
actions as state transitions
ⓘ
behaviors as sequences of states ⓘ specifications as formulas in temporal logic ⓘ |
| hasNotation | mathematical notation ⓘ |
| influenced | TLA+ NERFINISHED ⓘ |
| influencedBy |
predicate logic
ⓘ
set theory ⓘ temporal logic ⓘ |
| logicalFoundation | linear-time temporal logic ⓘ |
| purpose |
modeling algorithms
ⓘ
reasoning about system correctness ⓘ specifying concurrent systems ⓘ specifying distributed systems ⓘ |
| relatedTo | TLA+ NERFINISHED ⓘ |
| relatedTool | TLA+ model checker TLC NERFINISHED ⓘ |
| supports |
compositional reasoning
ⓘ
refinement reasoning ⓘ stepwise development ⓘ |
| usedFor |
designing fault-tolerant systems
ⓘ
specifying protocols ⓘ verifying concurrent algorithms ⓘ verifying distributed algorithms ⓘ |
| usesConcept |
actions
ⓘ
behaviors ⓘ invariants ⓘ liveness properties ⓘ safety properties ⓘ states ⓘ temporal operators ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.