LTLf2DFA is a tool that transforms an LTLf or a PLTLf formula into a minimal Deterministic Finite state Automaton (DFA) using MONA.
It is also available online at ltlf2dfa.diag.uniroma1.it.
This tool uses MONA for the generation of the DFA. Hence, you should first install MONA with all its dependencies on your system following the instructions here.
This tool is also based on the following libraries:
They are automatically added while installing LTLf2DFA.
- from PyPI:
pip install ltlf2dfa
- or, from source (
master
branch):
pip install git+https://github.com/whitemech/LTLf2DFA.git
- or, clone the repository and install:
git clone htts://github.com/whitemech/LTLf2DFA.git
cd ltlf2dfa
pip install .
- Parse an LTLf formula:
from ltlf2dfa.parser.ltlf import LTLfParser
parser = LTLfParser()
formula_str = "G(a -> X b)"
formula = parser(formula_str) # returns an LTLfFormula
print(formula) # prints "G(a -> X (b))"
- Or, parse a PLTLf formula:
from ltlf2dfa.parser.pltlf import PLTLfParser
parser = PLTLfParser()
formula_str = "H(a -> Y b)"
formula = parser(formula_str) # returns a PLTLfFormula
print(formula) # prints "H(a -> Y (b))"
- Translate a formula to the corresponding DFA automaton:
dfa = formula.to_dfa()
print(dfa) # prints the DFA in DOT format
-
Syntax and parsing support for the following formal languages:
- Propositional Logic;
- Linear Temporal Logic on Finite Traces;
- Pure-Past Linear Temporal Logic on Finite Traces.
-
Conversion from LTLf/PLTLf formula to MONA (First-order Logic)
NOTE: LTLf2DFA accepts either LTLf formulas or PLTLf formulas, i.e., formulas that have only past, only future or none operators.
To run tests: tox
To run only the code tests: tox -e py37
To run only the code style checks: tox -e flake8
To build the docs: mkdocs build
To view documentation in a browser: mkdocs serve
and then go to http://localhost:8000
LTLf2DFA is released under the GNU Lesser General Public License v3.0 or later (LGPLv3+).
Copyright 2018-2020 WhiteMech