Parents (Total: 3)

The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
MD5	254553C26266061AF0236EC8412B96EE
PackageArch	x86_64
PackageDescription	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.
PackageMaintainer	Fedora Project
PackageName	ltl2ba
PackageRelease	2.fc33
PackageVersion	1.3
SHA-1	5AF3FD1D154607A19A4AA67D8DBC1113C4394418
SHA-256	DC78919C55F88E7F2A1DA592D8A32C9FB1F28670DBA97D5B1A5C0BA1F934DA68

Key	Value
MD5	0B312EA48EA57737B5DE879D0366771A
PackageArch	aarch64
PackageDescription	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.
PackageMaintainer	Fedora Project
PackageName	ltl2ba
PackageRelease	2.fc33
PackageVersion	1.3
SHA-1	5C9C477E6EC5C59DC64B7067B99EEC09C2D65097
SHA-256	797D0277F53D2D71F4A749EAA3FC1AA7BA0E8C7F518FF0359709EE0BE5F349AE

Key	Value
MD5	E0B62F8C601A48106034332CE3C88B40
PackageArch	armv7hl
PackageDescription	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.
PackageMaintainer	Fedora Project
PackageName	ltl2ba
PackageRelease	2.fc33
PackageVersion	1.3
SHA-1	B7120BFFE39092B56C03686DA4B94DFDE67A815F
SHA-256	CA881FCB947FBD90BE3E41883BE9E8F80B55ED8D7067A984E36654525BF26CDC