Result for DDEB5011E4C8CCAEFF0DF6618454ECE072D676B9

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize46964
MD5360704D2EF866E2A3E1499EB50827BCF
SHA-1DDEB5011E4C8CCAEFF0DF6618454ECE072D676B9
SHA-2563A1012C36EC5F07932E92F2A9440D551DF0C980620D9F899F2BDB22545E6FE99
SSDEEP768:jHn0hU1x+k1/V6xRDjnAZ9bq5KpunjjprHLGT8bk9f03T0AhVjG9f4gmkJHP:bOU7+k1/6c3IZu8bwfmT0Ano/
TLSHT16C23B607B890CFA9C5D462F6FB5D875437A7479CD2EA6102DD180B207BCB9A60F3B642
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
MD59EB12022CFAFB72487AD17754F66A934
PackageArcharmv7hl
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-1092DB46A95E49AB2BEA350CEF130AAA933A2604B
SHA-25654030A4141741A598E3CC336D0A7196664FF16BE1165437E33A63E9C17AAA771