Result for 52779BAF9BAD6C028271636BD9F35C7FFAB68C35

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize71520
MD5541B93C06E17F3A7C5D10B22B064A7AD
SHA-152779BAF9BAD6C028271636BD9F35C7FFAB68C35
SHA-256D7A1B18AB646B8189F742DEDCCCF590A0183FD3C6BD305CC57AE42C80644B709
SSDEEP768:F11BDlaFiH32mzzqY2ZwdialSQrif14VtxytZwQLBrzs0CdVLpB3YCpOxz/af:hBDlaQX2EmO7gQro14V7IwWP5CExzi
TLSHT109634AAEBA0F3C92E386D338EB48A6B2772771A9D23740237E46431D90C6585DBF0559
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
MD511BC641190B79F2180226EC84A8C3B35
PackageArchaarch64
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
PackageRelease6.fc32
PackageVersion1.2
SHA-188E80111E1DFF089A3A7AD71E1431D84D7BF95D1
SHA-256A93F940C702CFF00CA34DD9A793B5E91F1D33C2C9AFFB185DC6FDB0989EC11EF