Result for 9DF9759A5386D7A53C8F7F6E5DFBB8ADAE414BFA

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize70256
MD5CB463197FC592BDB180A2AC2844BB431
SHA-19DF9759A5386D7A53C8F7F6E5DFBB8ADAE414BFA
SHA-256A449DFD20018095ED12BF9D6790F9CFA7D2BF8704C0B180B0D9CF4312DFB05EC
SSDEEP1536:DBYPe0qAe6tnwxxqj73ffw+7bt5MGrowPy9GcNnW8Ebru2w:TJR27ffw+ndYhEHl
TLSHT1FC635DDD7F0F7596E3C99238EB48868A7333745DE03681633045434DA6C6AABCBB19C6
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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

Key Value
MD5B90171DAAE43D2B4191F844C06A5A0E8
PackageArchaarch64
PackageDescriptionTranslate 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.
PackageMaintainerFedora Project
PackageNameltl2ba
PackageRelease3.fc34
PackageVersion1.3
SHA-1337EF9DAA6FF416519AFE02593A0D15CF2EE5E44
SHA-2562ED97428495BA3C3BAF8931798B4681EC2047CA300B04CEF9E6460E587A78D87