Result for F6849A86E395102B317BD084477A090C9E285E4B

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize62016
MD514396C96E9816D6960D91B01BB03FD36
SHA-1F6849A86E395102B317BD084477A090C9E285E4B
SHA-256E042BBFA8348C178A6C255501EC09DFF3DE40A9C2F3B3C00661486F6838C5222
SSDEEP1536:33JPu4DB/m2ue2NsbWEKHqu3SIJwvM3OK:3ZPuyBe2u3adKH07
TLSHT15F53198EB94F38A1E7D6C234EB486AF2B32775A9E33750237E46130D50CA295DBF0459
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
MD50CD0AF34C89D34924CC8280364C6214E
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.
PackageMaintainerumeabot <umeabot>
PackageNameltl2ba
PackageRelease2.mga9
PackageVersion1.3
SHA-13F0EF8271C8347A23398C0DE5468FFE452AEA73D
SHA-256F92F46403E35A647C63455B006AD5B93B761C9165A5FCC3B7BF997AE7C2DEBDC