Result for 94FE066A43285BC62FB7A264BC99652D570BF64C

Query result

Key Value
FileName./usr/bin/ltl2ba
FileSize61232
MD5303DC92B0982A675FA7B771B6C6FB607
SHA-194FE066A43285BC62FB7A264BC99652D570BF64C
SHA-2568B95EC9AAC4631690B95446797895A7DAF5A7DBF4E7A9FEE78B9C931D4A67AE5
SSDEEP768:asB85eEINm/9udZexzBGYJYMJi7VMx6t1mFMUvnLxlL54Qql7J:lB8RIqudwxBGyQ7mxBdlL5a9J
TLSHT1C35327172934EBE5CCEE2236C97E815B2B33E5641A1E014DFB40FB5FAC1BE194A02E55
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
MD55A24EAE7E4DAA25D6139D1661659A0D0
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
PackageRelease12.fc23
PackageVersion1.1
SHA-1254A10B9B9FFD66B6F13B576DDC0A36FBD649983
SHA-256AB12900EF33E9CEDBDDFD19F61DF0180CC29C8A11CCE9BB8DADD22CA2667E7D1