Result for 9DB6232C98CA5DD95A23312A292AB1C757E81410

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize46952
MD580554407FE989517C83785B11C4B3B08
SHA-19DB6232C98CA5DD95A23312A292AB1C757E81410
SHA-2566C5FDC4B423F9EB24A997988B60E701D2F175DDF1F251FF03BD312C00C3DD6ED
SSDEEP768:PFkUjmfddW6+TCnGABEmo8T+Z4OwjpeV5o93XOstLWH4a+NIdto4gmZu:9tCXRBpKjGfnwsti6Izo4
TLSHT1B623B70BB840CB9ACAD556F7F75D8B6436A75BACD2EA7503DC040A2076CF5A60F3B241
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
MD50D769418C6330AC78BF0FEA03183537C
PackageArcharmv5tel
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.fc14
PackageVersion1.1
SHA-110ABFC73F64EF27BE36F7F69BEE24F6ED48E480F
SHA-256E7E6A4B3B5B9B993B13D47CF2AAD6029CBCBEF69A1229AB49D12F99A2317744B