TY - GEN
T1 - Combining time and frequency domain specifications for periodic signals
AU - Chakarov, Aleksandar
AU - Sankaranarayanan, Sriram
AU - Fainekos, Georgios
PY - 2012/5/23
Y1 - 2012/5/23
N2 - In this paper, we investigate formalisms for specifying periodic signals using time and frequency domain specifications along with algorithms for the signal recognition and generation problems for such specifications. The time domain specifications are in the form of hybrid automata whose continuous state variables generate the desired signals. The frequency domain specifications take the form of an "envelope" that constrains the possible power spectra of the periodic signals with a given frequency cutoff. The combination of time and frequency domain specifications yields mixed-domain specifications that constrain a signal to belong to the intersection of the both specifications. We show that the signal recognition problem for periodic signals specified by hybrid automata is NP-complete, while the corresponding problem for frequency domain specifications can be approximated to any desired degree by linear programs, which can be solved in polynomial time. The signal generation problem for time and frequency domain specifications can be encoded into linear arithmetic constraints that can be solved using existing SMT solvers. We present some preliminary results based on an implementation that uses the SMT solver Z3 to tackle the signal generation problems.
AB - In this paper, we investigate formalisms for specifying periodic signals using time and frequency domain specifications along with algorithms for the signal recognition and generation problems for such specifications. The time domain specifications are in the form of hybrid automata whose continuous state variables generate the desired signals. The frequency domain specifications take the form of an "envelope" that constrains the possible power spectra of the periodic signals with a given frequency cutoff. The combination of time and frequency domain specifications yields mixed-domain specifications that constrain a signal to belong to the intersection of the both specifications. We show that the signal recognition problem for periodic signals specified by hybrid automata is NP-complete, while the corresponding problem for frequency domain specifications can be approximated to any desired degree by linear programs, which can be solved in polynomial time. The signal generation problem for time and frequency domain specifications can be encoded into linear arithmetic constraints that can be solved using existing SMT solvers. We present some preliminary results based on an implementation that uses the SMT solver Z3 to tackle the signal generation problems.
UR - http://www.scopus.com/inward/record.url?scp=84861208330&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84861208330&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-29860-8_22
DO - 10.1007/978-3-642-29860-8_22
M3 - Conference contribution
AN - SCOPUS:84861208330
SN - 9783642298592
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 294
EP - 309
BT - Runtime Verification - Second International Conference, RV 2011, Revised Selected Papers
T2 - 2nd International Conference on Runtime Verification, RV 2011
Y2 - 27 September 2011 through 30 September 2011
ER -