![]() Several bug fixes and introduce testing.Introduce interfaces and class hierarchy for the logic modules.Include *.lark files in the package build.Add parsing support for LTLfLast() and PLTLfStart() keywords.Introduce optional argument to to_dfa() method for DFA in MONA output.Hotfix problem on translation of the Once operator.Introduce PLTLfWeakBefore and PLTLfPastRelease support.If you are interested in this tool, and you use it in your own work, please consider citing it. LTL f2DFA is released under the GNU Lesser General Public License v3.0 or later (LGPLv3+).Ĭopyright 2018-2022 WhiteMech Sapienza University Citing Minimal Deterministic Buchi Automata Product. ![]() Efficient Algorithm Linear Temporal Logic to Deterministic Rabin Automata. To view documentation in a browser: mkdocs serve linear-temporal-logic buchi-automata Share. To run only the code style checks: tox -e flake8 Docs Have only past, only future or none operators. NOTE: LTL f2DFA accepts either LTL f formulas or PLTL f formulas, i.e., formulas that
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |