Result for 6D33AD0BBE31B001D0A431A6E4E1329F5FF605DD

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize48960
MD552E2E725B9D73B8A4FF2AB344EF370EB
SHA-16D33AD0BBE31B001D0A431A6E4E1329F5FF605DD
SHA-2564003BC09CD15EBBA1E5B8353196AAF3A6091C3798B4E51CA567A9D03E4ADAC99
SSDEEP768:wprMuY4Yoq7eSjc7vtp8mfwCmpxxmMoGWI9qi5MYH/gJYGyr:ArJiQtp/fh2xxmMoGWIz/
TLSHT1E923D9C6B550CB95C5D41AFBFB49C78837236B6895EBB101DC280A302BDB56B0F77982
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
MD59D2F7596CFFFF3D19BB4DA382D8650D7
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.
PackageMaintainerumeabot <umeabot>
PackageNameltl2ba
PackageRelease2.mga9
PackageVersion1.3
SHA-10D086A739AA3A8A08E64E241B6CC94EB20C17C73
SHA-256498F9E971BF72865BADE6875DDDEAF8FB0B7446287330AE2921E4432D1B666CA