Result for 028427CC530E34A9D9E1D69F5E61D45503827C83

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize135808
MD5A9CABE2D94489F7156C9F2E2D5BB5B75
SHA-1028427CC530E34A9D9E1D69F5E61D45503827C83
SHA-256D2F0F34642FA3E420EB9133CFAB1F12787E4780608FDA4EF4C0D2D16B4DD019D
SSDEEP1536:yyPF4lLtwamPqgu0aocohRL7Jxsc79TxsS:UnwamCURLd9T
TLSHT1F5D38603379C9BA7DF82283B51DAFE507352B94503108997B604075FABDAB3ACE5ED18
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
MD57A9AFC97AD9764EBF01BE5CE8CDD4E1D
PackageArchppc64le
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
PackageRelease11.fc22
PackageVersion1.1
SHA-115700EA8E41BFE3DF571E07175C1C9B3CE5D3D92
SHA-256DD1F68C01F24242902878DE957705E393FAEE4AF6DFB29134F9997DABC27CACB