Result for 6517E4104E39623C413A1D6262858C760273591F

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize66024
MD5C8EBBA2534520E5563A99525E3173BD6
SHA-16517E4104E39623C413A1D6262858C760273591F
SHA-256774C4C225BC9B42510EE7F5A44B748E84A3618468790165C18826F3C2326BDE6
SSDEEP1536:mQPXgVW5L35etfuRhcpUxmboWowkeHPb:bw6L3otahcvoWoQH
TLSHT17C53F60731B290FCDA35C6304EAB876298B7F42552323D7F326497781E1BE614E8E936
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
MD52718F94D0D2B647F9A61F1E56468AC3C
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.
PackageMaintainermartinw <martinw>
PackageNameltl2ba
PackageRelease1.mga8
PackageVersion1.3
SHA-111DEA31945CA81F3F975336AD3DA20302ECCBC7E
SHA-25624FAFB7217D7B3F43CE78E565D2B7B894416B55882B0C9A2245492BE47C17970