On TLA as a logic
نویسندگان
چکیده
As a logic TLA has a precise syntax and semantics We de ne these in the next section Our intent is not to develop a new TLA but rather to explain and to re ne Lamport s de nition of TLA Like HOL and other logics TLA can serve for representing reac tive systems in several styles In particular a speci cation may describe concurrent steps as interleaved or simultaneous communication between components may be synchronous or asynchronous We discuss a few styles in section Proofs in TLA rely on basic rules of temporal logic rules for re nement and rules for composition We state the principal rules in sections and Following we show that some of them arise from general logical or algebraic considerations largely independent of the details of TLA
منابع مشابه
On TLA
We describe the Temporal Logic of Actions (TLA) from a logical perspective. After giving the syntax and semantics of TLA, we discuss some methods for representing reactive systems in TLA and study veriication rules. 1 The L in TLA The Temporal Logic of Actions (TLA) is a variant of temporal logic, designed for the speciication and veriication of reactive systems in terms of their actions. In th...
متن کاملA Definitional Encoding of TLA* in Isabelle/HOL
We mechanise the logic TLA∗ [8], an extension of Lamport’s Temporal Logic of Actions (TLA) [5] for specifying and reasoning about concurrent and reactive systems. Aiming at a framework for mechanising the verification of TLA (or TLA∗) specifications, this contribution reuses some elements from a previous axiomatic encoding of TLA in Isabelle/HOL by the second author [7], which has been part of ...
متن کاملTLA + Proofs
TLA is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA proofs and check them with TLAPS, the TLA Proof System. We use Peterson’s mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE for TLA) help users to manage large, complex pro...
متن کاملModel Checking TLA+ Specifications
TLA is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA specification by checking invariance properties of a finite-state model of the specification. It accepts a subclass of TLA specifications that should include most descriptions of real system designs...
متن کاملOn the Logic of TLA+
TLA+ is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic TLA and classical set-theory, it provides an expressive specification formalism and supports assertional verification.
متن کامل