| Key | Value |
|---|---|
| FileName | ./usr/bin/ltl2ba |
| FileSize | 54920 |
| MD5 | C6E79AA3E21FFB27AD11B40EA18A1C5B |
| SHA-1 | CBA228F3F03A7568F983B0488E5AEBC9FEF593DD |
| SHA-256 | 143EA17148D11F6E831BB6C208593C9CA46FAB8918312FE5E2ADAB781E18D8F1 |
| SSDEEP | 768:t1/4nzuQFFCC9+OJ30R0P0tkanX1dZsGJQ5lHsTc6ZAGqlld07L:tKnqT9K8tkanX1IcAlec6K27L |
| TLSH | T17833D6893C346BE5ECAA5535E47D929B0B72A0392F1D01CCBB40DB0FBCB7E159606A74 |
| hashlookup:parent-total | 2 |
| hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | 48DE6800D247BB356E3B655A11A8E972 |
| PackageArch | s390 |
| PackageDescription | Translate 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. |
| PackageMaintainer | Fedora Project |
| PackageName | ltl2ba |
| PackageRelease | 3.fc15 |
| PackageVersion | 1.1 |
| SHA-1 | 8DC420BCE85C44B0AD1D22754D7E28D7D5252C97 |
| SHA-256 | D65D13420FE02DD78969D51986B3582C1E710E252A9CB6C2DC2692B078ECB325 |
| Key | Value |
|---|---|
| MD5 | 4C1652646B785E0C2DCB7C3A6A5200A5 |
| PackageArch | s390 |
| PackageDescription | Translate 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. |
| PackageMaintainer | Fedora Project |
| PackageName | ltl2ba |
| PackageRelease | 3.fc15 |
| PackageVersion | 1.1 |
| SHA-1 | 2650A3A32655A78AEEEA3B437F6952EA52BFD16F |
| SHA-256 | 0E2420060CA2E88F0C0B29B21D5F7CAADE0E1496A0AA82386461A65CA295C233 |