Result for D49311E343BE2E79A714E9B882D4507439358716

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize56928
MD51B62029913FB60C3499DC4E69118676F
SHA-1D49311E343BE2E79A714E9B882D4507439358716
SHA-256B02C2D917A82399E5A13395750D4987D9F0EEA9D8574EA68F34A62A5D44FED20
SSDEEP768:Y5AIvu/ioKjXNT6OMD2pITU26vCLrp87ZVV6ySUAGzsGGf+z:FeD92HKaTICL66yH4Gz
TLSHT14943F9563C35C7E9EC9D253A9539415B1F32A2B42F1D11CDBB40EB0FBCABE244A46E24
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
MD5050FAEEA92FB7D2196CBDC3879DF210F
PackageArchs390
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
PackageRelease6.fc19
PackageVersion1.1
SHA-10F85CDAE7A1B354628B1F2C292836DE22541295E
SHA-25643545E77EB7FCC538F34C98815193486CAD3D6E22A54CAB1527051EA08EF05FB