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	DA60AEA2BC47526AD26355F3032DFF2A
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	6.fc32
PackageVersion	1.2
SHA-1	3195FA2BCCEEDA676D8C12DB5A46DABBCD5B5A0A
SHA-256	71F254EC7810C907C8DB083D1AAEBAD25C703751278CECC951BB6027117D36DF

Key	Value
MD5	E018E9F7185BDD0AB51F0CA8F453256C
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	6.fc32
PackageVersion	1.2
SHA-1	46102AF94E8C2B4E9CA3EFB5A5D2CEC14AA6905E
SHA-256	B25E34CF31DD21FA4AB6E3CC6444DAEB3F7AF2189AF1368AD6F3DEE299AA554E

Key	Value
MD5	11BC641190B79F2180226EC84A8C3B35
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	6.fc32
PackageVersion	1.2
SHA-1	88E80111E1DFF089A3A7AD71E1431D84D7BF95D1
SHA-256	A93F940C702CFF00CA34DD9A793B5E91F1D33C2C9AFFB185DC6FDB0989EC11EF