Result for CD8F0C22E6AEBF4DFBE384375B5DDC54B082E0D5

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize60680
MD50925C6088C4AEA54C3FAE26B8F1B2E11
SHA-1CD8F0C22E6AEBF4DFBE384375B5DDC54B082E0D5
SHA-2563DC75E8C55ED6D2508DC5081ED86F5C190316B76E5A96B51C738DA29E513E6A1
SSDEEP768:2/iOFj8Tbp9zHZXV0ZvacBdR7O1BEbmqbm1XeihsAGKGexfg:uW9zHZl0ZvvR7iBom71XNVGeVg
TLSHT19753E65654308A98D871763356AB4F6293B738B52BED6A1C3BB9DF1F4CF0B006209972
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
MD552FE4B334133745B69816A250B27D9DD
PackageArchs390x
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
PackageRelease4.fc17
PackageVersion1.1
SHA-1141A7337A8E0CA577FEDCF033406BD32BC29FBAD
SHA-256AEB995BD611DC07881E510377A7DF3DE8E58DDF7FCF7C6A28F0D258B63133DBF