Result for 3B95CD12C8A21872CFB5C89EFCF29D6C1248C618

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize65292
MD5630B1C63445880F74B5BF343253C7B2C
SHA-13B95CD12C8A21872CFB5C89EFCF29D6C1248C618
SHA-256ECC00A51E29F6CCB213711919F32C82ED4A66597E1CA454C059D2D700351483D
SSDEEP1536:3pee1ixHMPK6+ne7pVn4QeL8+uMVF5/E:3peP9Qp1n7WN
TLSHT178530A8DB522C6B2EA625CF00F45BBA11D33811A60E7D571FFCE1B5A3872215BF5A234
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
MD51E9F04CFE6AEA2B9985B9F5C202742E3
PackageArchi586
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.
PackageMaintainerumeabot <umeabot>
PackageNameltl2ba
PackageRelease0.b1.2.mga7
PackageVersion1.2
SHA-1150F65EED696DEFDA9819840163A8B3D75729000
SHA-25624B4331331333006A8F7434682B78FB18E3D648023BD777FDE3AD8B7E56486C9