Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: ltl2ba | Distribution: Mageia |
Version: 1.3 | Vendor: Mageia.Org |
Release: 2.mga9 | Build date: Tue Mar 15 08:46:10 2022 |
Group: Sciences/Computer science | Build host: localhost |
Size: 85062 | Source RPM: ltl2ba-1.3-2.mga9.src.rpm |
Packager: umeabot <umeabot> | |
Url: http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/ | |
Summary: Fast translation from LTL formulas to Buchi automata |
Translate from Linear temporal logic (LTL) formulas to Buchi automata. LTL is a type of formal logic that extends formal logic with qualifiers involving time. A Buchi automaton is the extension of a finite state automaton to infinite inputs, and are useful for specifying behavior of non-terminating systems (such as hardware or operating systems). A Buchi automaton accepts an infinite input sequence if and only if there exists a run of the automaton which visits at least one of the final states infinitely often. The implementation is based on the translation algorithm by Gastin and Oddoux, presented at the CAV Conference, held in 2001, Paris, France 2001.
GPLv2+
* Tue Mar 15 2022 umeabot <umeabot> 1.3-2.mga9 + Revision: 1792891 - Mageia 9 Mass Rebuild * Tue Aug 18 2020 martinw <martinw> 1.3-1.mga8 + Revision: 1615116 - update to version 1.3
/usr/bin/ltl2ba /usr/lib/.build-id /usr/lib/.build-id/64 /usr/lib/.build-id/64/32b5d2854c765cbdd196f9a253b01b3ead2c8a /usr/share/doc/ltl2ba /usr/share/doc/ltl2ba/README /usr/share/licenses/ltl2ba /usr/share/licenses/ltl2ba/LICENSE
Generated by rpm2html 1.8.1
Fabrice Bellet, Wed Jan 22 09:05:03 2025