LTLf and PLTLf to Deterministic Finite-state Automata (DFA) 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 http://ltlf2dfa.diag.uniroma1.it.

Prerequisites

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.

Install

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 https://github.com/whitemech/LTLf2DFA.git
cd ltlf2dfa
pip install .

How To Use

• 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

Features

• 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.

Tests

To run tests: tox

To run only the code tests: tox -e py3.7

To run only the code style checks: tox -e flake8

Docs

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 @ Sapienza University

Citing

If you are interested in this tool, and you use it in your own work, please consider citing it.

Author

Francesco Fuggitti

History

1.0.1 (2020-07-03)

• Introduce optional argument to to_dfa() method for DFA in MONA output
• Add parsing support for LTLfLast() and PLTLfStart() keywords
• Some fixes
• Increase code coverage

1.0.0 (2020-05-20)

• Refinement of all the grammars. Extensive improvement of the parsing.
• Introduce interfaces and class hierarchy for the logic modules.
• Several bug fixes and introduce testing.
• Introduce of docs.
• Introduce Continuous Integration.
• Refactor translation feature.
• Replace parsing library PLY with Lark.

0.1.0 (2018-07-18)

• First release on PyPI.

Project details

This version 1.0.1 1.0.0.post0 1.0.0 0.2.2.post0 0.2.2 0.2.1.post1 0.2.1.post0 0.2.1 0.2.0.post3 0.2.0.post2 0.2.0.post1 0.2.0.post0 0.2.0 0.1.9 0.1.8 0.1.7 0.1.6 0.1.5 0.1.4 0.1.3 0.1.2.post2 0.1.2.post1 0.1.2.post0 0.1.2