Result for ABB16F9C31BBC730C9E650FABA4BCE77CF347835

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize57072
MD5865025C83B54540E4DA3E6A0DD5A0A1B
SHA-1ABB16F9C31BBC730C9E650FABA4BCE77CF347835
SHA-2561CD9C7C18C56238C07E8350438FF7F42AD032AE01BFFCD30300B71DE756586D9
SSDEEP768:lkmQvJ1rH49pURBrnkrMhLuS0zUBI/GzbpkUrzAIUMPR4fdgqaWuLr6CLyip:lkJ3rHQpUTrnkrMsSKKzbHPAI3Vv/h
TLSHT1FD43D55AF890CB69C9D026B6F7498B5933131B68D3DE330ADD140A343BEB4A70F7A641
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
MD56FFC6DE18997BCBC4319B231F8DCA15B
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
PackageRelease3.fc34
PackageVersion1.3
SHA-1801C52AC5A91564717FDFA22300E53F122B26D35
SHA-2564A3DD906997827D8B21465318D089020A232B80367145662F1A3B241905D4466