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	6FFC6DE18997BCBC4319B231F8DCA15B
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	3.fc34
PackageVersion	1.3
SHA-1	801C52AC5A91564717FDFA22300E53F122B26D35
SHA-256	4A3DD906997827D8B21465318D089020A232B80367145662F1A3B241905D4466

Key	Value
MD5	36F74407DABAC0DAFF2F907C5C5B299B
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	3.fc34
PackageVersion	1.3
SHA-1	4939129D1A942E17D7A556E926EF0341160E3637
SHA-256	01AC7F0FEF366F79D5A94E07AA9CFEFFA791A22D24F740A18E961E05583AAF51

Key	Value
MD5	B90171DAAE43D2B4191F844C06A5A0E8
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	3.fc34
PackageVersion	1.3
SHA-1	337EF9DAA6FF416519AFE02593A0D15CF2EE5E44
SHA-256	2ED97428495BA3C3BAF8931798B4681EC2047CA300B04CEF9E6460E587A78D87