Search
Now showing items 1-2 of 2
ppLTLTT : Temporal Testing for Pure-Past Linear Temporal Logic Formulae
(2023)
This paper presents ppLTLTT, a tool for translating pure-past linear temporal logic formulae into temporal testers in the form of automata. We show how ppLTLTT can be used to easily extend existing LTL-based tools, such ...
Automata Constructions for LTL with Past
(Department of Computer Science and Engineering University of Gothenburg | Chalmers University of Technology, 2024)
Linear temporal logic (LTL) is a popular language in formal verification,
especially in the domains of model checking and reactive synthesis. Because
its semantics is defined in terms of infinite sequences of symbols ...