Given an automaton over a finite alphabet of atomic propositions (events), produce an STL formula over predicates on a real-valued signal x(t) (or a vector of signals) whose Boolean evaluation matches the automaton language.
Before we get into the "how," let's clarify what these two file types are. sdfa to stl