This note describes the representation of Lamport's Temporal Logic of Actions that comes with the standard distribution of the generic theorem prover Isabelle. It is based on a simple technique for embedding possible-worlds based logics in Isabelle. 1 Background Formal methods will only be applied in practice if they are supported by suuciently powerful, highly automated, and extensible proof tools. This note describes the design of a representation of Lamport's Temporal Logic of Actions 10] in the higher-order logic of the interactive theorem prover Isabelle 16]. Representations of object logics in logical frameworks are traditionally classiied as \deep" or \shallow" embeddings. In a deep embedding, the syntax and semantics of the object logic are fully formalized in the meta-logic. For a temporal logic, this would mean to give an inductive deenition of formula syntax, and to deene concepts such as state, state sequence, temporal succession, and the satisfaction relation. One can then reason not only \inside" the logic, applying its axioms and rules, but also \about" the logic. In particular, one can justify the logic's proof system by establishing sound-ness and completeness theorems. However, it is rather diicult to set up a deep embedding in such a way that it is also comfortable to work in. Since our emphasis has been on developing an apparatus that is useful for the veriication of actual case studies, we have opted for a shallow embedding of TLA. Even more, our theory is axiomatic, although the HOL approach to deening object logics encourages the use of deenitional embeddings. This decision comes from the fact that the deenition of the concept of a universal state space that underlies TLA is not well supported by the type system of Isabelle/HOL. The remaining temporal logic axioms could easily be derived from a deenition of innnite state sequences, either as functions from the natural numbers to states or via a coinductive deenition. We have deliberately not done so in order to force the user to use the TLA proof system
[1]
Martín Abadi,et al.
A TLA Solution to the RPC-Memory Specification Problem
,
2016,
Formal Systems Specification.
[2]
Leslie Lamport,et al.
The temporal logic of actions
,
1994,
TOPL.
[3]
Holger Busch.
A Practical Method for Reasoning about Distributed Systems in a Theorem Prover
,
1995,
TPHOLs.
[4]
Stephan Merz,et al.
Specifying and Verifying Fault-Tolerant Systems
,
1994,
FTRTFT.
[5]
Thomas Långbacka,et al.
A HOL Formalisation of the Temporal Logic of Actions
,
1994,
TPHOLs.
[6]
J. von Wright,et al.
Mechanizing The Temporal Logic Of Actions In HOL
,
1991,
1991., International Workshop on the HOL Theorem Proving System and Its Applications.
[7]
Leslie Lamport,et al.
How to Write a Proof
,
1995
.
[8]
Markus Wenzel,et al.
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
,
1999,
TPHOLs.
[9]
Olaf Müller,et al.
Possibly Infinite Sequences in Theorem Provers: A Comparative Study
,
1997,
TPHOLs.
[10]
Edward Y. Chang,et al.
STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
,
1996,
CAV.
[11]
Stephan Merz,et al.
Rules for Abstraction
,
1997,
ASIAN.
[12]
Sara Kalvala,et al.
A Formulation of TLA in Isabelle
,
1995,
TPHOLs.