Result for B172812244B85876DA948CD6A0AB9B976B7D92ED

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize62016
MD5E600A13A3F8A6CDADE689766AC6BA99E
SHA-1B172812244B85876DA948CD6A0AB9B976B7D92ED
SHA-2565850A3130C52F8F6577E77FE4C43E4CE8B9CA33E54DCEC2FB6D7126EA7951DF1
SSDEEP1536:fchzweTiNqt08AryRqlD43seUK0zguOOCI6O:fazJTSqtFA87MCnO
TLSHT144534B8EB90F3CA1E7C6D278EB4866B2B32771A9D33741237E4A030E90C6595D7F0599
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
MD5136A43EC165E78679EDD6B9E7CF39EBE
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.
PackageMaintainermartinw <martinw>
PackageNameltl2ba
PackageRelease1.mga8
PackageVersion1.3
SHA-1337DC4948196850807C8F3AA3D9EEC539A379848
SHA-256BE28320B90F3E2A8318988E3BDBFCCFA04A98ECD947448C07D06A97DE49D75EF