Parents (Total: 14)

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

Key	Value
MD5	B0FDE702CF1272549A368A00EFCFBE98
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	2.mga9
PackageVersion	1.3
SHA-1	1554B91556E581B34F0B058B029769059D0D3BDD
SHA-256	8FFB379492186B99D9E738C8064130AC291287D62280038BF1DAD1B60461BE74

Key	Value
MD5	2718F94D0D2B647F9A61F1E56468AC3C
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	martinw <martinw>
PackageName	ltl2ba
PackageRelease	1.mga8
PackageVersion	1.3
SHA-1	11DEA31945CA81F3F975336AD3DA20302ECCBC7E
SHA-256	24FAFB7217D7B3F43CE78E565D2B7B894416B55882B0C9A2245492BE47C17970

Key	Value
MD5	A6FF9D0F94C6B4EDA8A9689411D17649
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	umeabot <umeabot>
PackageName	ltl2ba
PackageRelease	2.mga9
PackageVersion	1.3
SHA-1	2C698ED1C0E9A6B54396998646D690A3D1CD43FE
SHA-256	F959CB3C0BCBBE86EBAE7B939A7DF7A2B85D364F7B1211D7303634325D222A14

Key	Value
MD5	0CD0AF34C89D34924CC8280364C6214E
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	umeabot <umeabot>
PackageName	ltl2ba
PackageRelease	2.mga9
PackageVersion	1.3
SHA-1	3F0EF8271C8347A23398C0DE5468FFE452AEA73D
SHA-256	F92F46403E35A647C63455B006AD5B93B761C9165A5FCC3B7BF997AE7C2DEBDC

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

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	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

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	9D2F7596CFFFF3D19BB4DA382D8650D7
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	umeabot <umeabot>
PackageName	ltl2ba
PackageRelease	2.mga9
PackageVersion	1.3
SHA-1	0D086A739AA3A8A08E64E241B6CC94EB20C17C73
SHA-256	498F9E971BF72865BADE6875DDDEAF8FB0B7446287330AE2921E4432D1B666CA

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	136A43EC165E78679EDD6B9E7CF39EBE
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	martinw <martinw>
PackageName	ltl2ba
PackageRelease	1.mga8
PackageVersion	1.3
SHA-1	337DC4948196850807C8F3AA3D9EEC539A379848
SHA-256	BE28320B90F3E2A8318988E3BDBFCCFA04A98ECD947448C07D06A97DE49D75EF

Key	Value
MD5	F9C8235187784074346CFAEF8C9E4F74
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	martinw <martinw>
PackageName	ltl2ba
PackageRelease	1.mga8
PackageVersion	1.3
SHA-1	3C71C25B2C310BAC92B5C3094A49344E64D241FB
SHA-256	C94CCC561FA25E8D3D8D670B3D86E3D1624B1288713C9149349A0118F4B20B36

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	92473BC6EC469C9253E3062C21DFB464
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	martinw <martinw>
PackageName	ltl2ba
PackageRelease	1.mga8
PackageVersion	1.3
SHA-1	4FF96703BE7AA6FA7716A7DB83193916C76857AE
SHA-256	1E1B1EDCE107A20B8B79DC6B3BE5E8941DCA45163C56E5BD4BAC413CA13B63E8