Result for B6E30F358B9B0E0BD1D965184AA8647C348D9205

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize66176
MD5EA930971B076058F458517F5C10499F3
SHA-1B6E30F358B9B0E0BD1D965184AA8647C348D9205
SHA-25603C89F000476C938234E0A04776D44B5E9B74E447538E5B68F95669866E0F018
SSDEEP1536:0wazUEOveChPNqa4XQ00PBKsy0fSx8G0fL1J:0uHGChvTBny0fSx8G0fL
TLSHT11153390971A258FCC9658430CDFB966229B5FC6A05323DBF74A4BE752F1BE200F5E921
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
MD5254553C26266061AF0236EC8412B96EE
PackageArchx86_64
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
PackageRelease2.fc33
PackageVersion1.3
SHA-15AF3FD1D154607A19A4AA67D8DBC1113C4394418
SHA-256DC78919C55F88E7F2A1DA592D8A32C9FB1F28670DBA97D5B1A5C0BA1F934DA68