Result for 0FD0D47318425D58DE4E1B52A47E3C695B6D7C3F

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize135800
MD53CA37A096F75F8571531F3C1DB6AF667
SHA-10FD0D47318425D58DE4E1B52A47E3C695B6D7C3F
SHA-25627B4A4F3675439F936D3D018506562D1F0145094B98B18F8AB7D319DC20FBF4A
SSDEEP1536:aTqgMuKMiaoIBZae2nRLlmJQ71/UW/DBrzkdud/g+otkAesS:5BMi2ZaecBmJU19GB
TLSHT12DD3500337489BA6EF82287B5199FE507352B94A13509987B704075F8FEE73A8E5FC18
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
MD5FC535E0FE65E4F8CDC78B5E07FC0AF15
PackageArchppc64le
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
PackageRelease10.fc21
PackageVersion1.1
SHA-12BA06D98FF2EA48E4E15680EB2BF7DE26CAD284B
SHA-256EFCF62805DDCF6CE30671ED737DC87FCFBD9D814C2FCAB2DEF0B151A72795F71