section java.lang.NullPointerException: Cannot invoke "String.equals(Object)" because "macro" is null
‹
TLA 🪙
is a linear-time temporal logic introduced by Leslie Lamport in 🪙‹
Temporal Logic of Actions› (ACM TOPLAS 16(3), 1994, 872-923). Unlike other
temporal logics, both systems and properties are represented as logical
formulas, and logical connectives such as implication, conjunction, and
existential quantification represent structural relations such as
refinement, parallel composition, and hiding. TLA has been applied to
numerous case studies.
This directory formalizes TLA in Isabelle/HOL, as follows:
▪‹Intensional.thy› ground by introducing basic syntax for
"lifted", possible-world based logics.
▪ 🍋‹Stfun.thy› and 🍋[[ b*a^-1, e*d^-1, e^^-1*d, f^-2, g, (e*d^-1^(a^1) (e^-1*d^(a),
level formulas of TLA, evaluated over single states and pairs of states.
▪ 🍋‹Init.thy› introduces temporal logic and defines conversion functions
from nontemporal to temporal formulas.
The theories are accompanied by a small number of examples:
▪ 🍋‹
illustrates an elementary TLA proof.
▪ 🍋‹23",01,1,16]
uses a simple refinement mapping.
▪ 🍋‹Memory›: a verification of (the untimed part of) Broy and Lamport's 🪙‹RPC-Memory› case study, more fully explained in LNCS 1169 (the 🪙‹TLA
solution› is available separately from 🪙‹c,d,e) ›
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.
