Parents (Total: 56)

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

Key	Value
MD5	9BA5BF215D0872DD69E3A5E6D0738835
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.fc19
PackageVersion	1.1
SHA-1	00325218BFF72DAD35E91E7EE4138606679C63A4
SHA-256	C1BF5CEACAD82A82C29B2AD9C4000E8F2DBC21E9061CFE4372E82448E9EA91BB

Key	Value
MD5	9EB12022CFAFB72487AD17754F66A934
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	4.fc17
PackageVersion	1.1
SHA-1	092DB46A95E49AB2BEA350CEF130AAA933A2604B
SHA-256	54030A4141741A598E3CC336D0A7196664FF16BE1165437E33A63E9C17AAA771

Key	Value
MD5	050FAEEA92FB7D2196CBDC3879DF210F
PackageArch	s390
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.fc19
PackageVersion	1.1
SHA-1	0F85CDAE7A1B354628B1F2C292836DE22541295E
SHA-256	43545E77EB7FCC538F34C98815193486CAD3D6E22A54CAB1527051EA08EF05FB

Key	Value
MD5	0D769418C6330AC78BF0FEA03183537C
PackageArch	armv5tel
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.fc14
PackageVersion	1.1
SHA-1	10ABFC73F64EF27BE36F7F69BEE24F6ED48E480F
SHA-256	E7E6A4B3B5B9B993B13D47CF2AAD6029CBCBEF69A1229AB49D12F99A2317744B

Key	Value
MD5	52FE4B334133745B69816A250B27D9DD
PackageArch	s390x
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	4.fc17
PackageVersion	1.1
SHA-1	141A7337A8E0CA577FEDCF033406BD32BC29FBAD
SHA-256	AEB995BD611DC07881E510377A7DF3DE8E58DDF7FCF7C6A28F0D258B63133DBF

Key	Value
MD5	1E9F04CFE6AEA2B9985B9F5C202742E3
PackageArch	i586
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	umeabot <umeabot>
PackageName	ltl2ba
PackageRelease	0.b1.2.mga7
PackageVersion	1.2
SHA-1	150F65EED696DEFDA9819840163A8B3D75729000
SHA-256	24B4331331333006A8F7434682B78FB18E3D648023BD777FDE3AD8B7E56486C9

Key	Value
MD5	7A9AFC97AD9764EBF01BE5CE8CDD4E1D
PackageArch	ppc64le
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	11.fc22
PackageVersion	1.1
SHA-1	15700EA8E41BFE3DF571E07175C1C9B3CE5D3D92
SHA-256	DD1F68C01F24242902878DE957705E393FAEE4AF6DFB29134F9997DABC27CACB

Key	Value
MD5	5A24EAE7E4DAA25D6139D1661659A0D0
PackageArch	s390
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	12.fc23
PackageVersion	1.1
SHA-1	254A10B9B9FFD66B6F13B576DDC0A36FBD649983
SHA-256	AB12900EF33E9CEDBDDFD19F61DF0180CC29C8A11CCE9BB8DADD22CA2667E7D1

Key	Value
MD5	4C1652646B785E0C2DCB7C3A6A5200A5
PackageArch	s390
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.fc15
PackageVersion	1.1
SHA-1	2650A3A32655A78AEEEA3B437F6952EA52BFD16F
SHA-256	0E2420060CA2E88F0C0B29B21D5F7CAADE0E1496A0AA82386461A65CA295C233

Key	Value
MD5	FC535E0FE65E4F8CDC78B5E07FC0AF15
PackageArch	ppc64le
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	10.fc21
PackageVersion	1.1
SHA-1	2BA06D98FF2EA48E4E15680EB2BF7DE26CAD284B
SHA-256	EFCF62805DDCF6CE30671ED737DC87FCFBD9D814C2FCAB2DEF0B151A72795F71