Result for 26F5A2394D9A82AF6F094B9C03AA2312E28984E4

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize61936
MD5553E42DC231899227AF6F31B71852692
SHA-126F5A2394D9A82AF6F094B9C03AA2312E28984E4
SHA-25657C0DD622CE265950633F904A569856B248CC54BC226F4C2CC3C64A50E8DF566
SSDEEP1536:7o+25L0qvJGC3goQ6XRonYimrOP/BSl+Ah:8+255xGmgoTECrgBSp
TLSHT141531947727250BCDA74C6304DAB86B248B7B47541323E7F3694AB782F46E221EDE931
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
MD5A6FF9D0F94C6B4EDA8A9689411D17649
PackageArchx86_64
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-12C698ED1C0E9A6B54396998646D690A3D1CD43FE
SHA-256F959CB3C0BCBBE86EBAE7B939A7DF7A2B85D364F7B1211D7303634325D222A14