mlsanityData to 14 Oct 2026

3vLTL: A Tool to Generate Automata for Three-valued LTL

arXiv 2311.09787 ↗First posted 16 Nov 2023cs.FL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Multi-valued logics have a long tradition in the literature on system verification, including run-time verification. However, comparatively fewer model-checking tools have been developed for multi-valued specification languages. We present 3vLTL, a tool to generate Buchi automata from formulas in Linear-time Temporal Logic (LTL) interpreted on a three-valued semantics. Given an LTL formula, a set of atomic propositions as the alphabet for the automaton, and a truth value, our procedure generates a Buchi automaton that accepts all the words that assign the chosen truth value to the LTL formula. Given the particular type of the output of the tool, it can also be seamlessly processed by third-party libraries in a natural way. That is, the Buchi automaton can then be used in the context of formal verification to check whether an LTL formula is true, false, or undefined on a given model.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 25 references that are in the map. First posted on arXiv 16 Nov 2023.

Builds on

0 of 25 references.

No references here yet.

Built on by

Not cited yet.