Abstract
TLAp 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.
Keywords
Cite this article
@article{cai-1319,
author = {Stephan Merz},
title = {On the Logic of TLAp},
journal = {Computing and Informatics},
volume = {22},
number = {3-4},
pages = {351--379},
year = {2003},
issn = {1335-9150},
url = {https://cai.type.sk/content/2003/3-4/on-the-logic-of-tlap/}
}
TY - JOUR AU - Stephan Merz TI - On the Logic of TLAp JO - Computing and Informatics VL - 22 IS - 3-4 SP - 351 EP - 379 PY - 2003 SN - 1335-9150 UR - https://cai.type.sk/content/2003/3-4/on-the-logic-of-tlap/ KW - Temporal logic KW - reactive systems KW - specification KW - verification KW - refinement ER -
Merz, S. (2003). On the Logic of TLAp. Computing and Informatics, 22(3-4), 351–379. https://cai.type.sk/content/2003/3-4/on-the-logic-of-tlap/