Result for 5367AE78A26E69B3F6E949ECE56BC478C6876DCD

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize73512
MD57887E9E89D032EC005B5E3F1C6BC5D5C
SHA-15367AE78A26E69B3F6E949ECE56BC478C6876DCD
SHA-2560369C7FB3A13D3DD483BD7FDB15EC0E1B896F737E4220F048E55CE9D7392182D
SSDEEP768:Qy2cDCbInp98kdpnbauAbbkV0NHiXKcoL3xqcQUON1ogFlvdbuYV7970ZtwDnAC4:ZDCbInpuW8bDHNc8qHUON1r5uYjHs
TLSHT186731A8D7517C577EA728CB10B41BAA12C73911960E7D5B2FFCE2BAA7432114BF0A325
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
MD5B0FDE702CF1272549A368A00EFCFBE98
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
PackageRelease2.mga9
PackageVersion1.3
SHA-11554B91556E581B34F0B058B029769059D0D3BDD
SHA-2568FFB379492186B99D9E738C8064130AC291287D62280038BF1DAD1B60461BE74