Combining Time and Frequency Domain Specifications for Periodic Signals

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.

[1]  George J. Pappas,et al.  Robustness of Temporal Logic Specifications , 2006, FATES/RV.

[2]  Lars Hedrich,et al.  Model Checking of Analog Systems using an Analog Specification Language , 2008, 2008 Design, Automation and Test in Europe.

[3]  Marc Geilen,et al.  On the Construction of Monitors for Temporal Logic Properties , 2001, RV@CAV.

[4]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[5]  Rob A. Rutenbar,et al.  Time Domain Verification of Oscillator Circuit Properties , 2006, Electron. Notes Theor. Comput. Sci..

[6]  Yassine Lakhnech,et al.  Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems , 2004, Lecture Notes in Computer Science.

[7]  László Lovász,et al.  Hit-and-run mixes fast , 1999, Math. Program..

[8]  Insup Lee,et al.  Testing and Monitoring Model-based Generated Program , 2003, Electron. Notes Theor. Comput. Sci..

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Robert L. Smith.  The hit-and-run sampler: a globally reaching Markov chain sampler for generating arbitrary multivariate distributions , 1996, Winter Simulation Conference.

[11]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[12]  Dirk P. Kroese,et al.  Simulation and the Monte Carlo Method (Wiley Series in Probability and Statistics) , 1981 .

[13]  J. Hammersley.  SIMULATION AND THE MONTE CARLO METHOD , 1982 .

[14]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[15]  Richard M. Murray,et al.  Feedback Systems An Introduction for Scientists and Engineers , 2007 .

[16]  Sriram Sankaranarayanan,et al.  Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems , 2010, HSCC '10.

[17]  S. Vempala,et al.  Hit-and-Run is Fast and Fun ∗ , 2002 .

[18]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[19]  P. Rousseeuw,et al.  Wiley Series in Probability and Mathematical Statistics , 2005 .

[20]  Mahesh Viswanathan,et al.  Membership questions for timed and hybrid automata , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[21]  Grigore Rosu,et al.  Monitoring programs using rewriting , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[22]  Alan V. Oppenheim,et al.  Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  Henrik Reif Andersen,et al.  Runtime Verification of Timed LTL using Disjunctive Normalized Equation Systems , 2003, RV@CAV.

[24]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[25]  Dejan Nickovic,et al.  Monitoring Temporal Properties of Continuous Signals , 2004, FORMATS/FTRTFT.

[26]  Bernd Finkbeiner,et al.  Checking Finite Traces using Alternating Automata , 2001, Electron. Notes Theor. Comput. Sci..

[27]  David Monniaux,et al.  On using floating-point computations to help an exact linear arithmetic decision procedure , 2009, CAV.

[28]  Grigore Rosu,et al.  Monitoring Algorithms for Metric Temporal Logic Specifications , 2004, RV@ETAPS.

[29]  Lars Hedrich,et al.  A formal approach to verification of linear analog circuits with parameter tolerances , 1998, Proceedings Design, Automation and Test in Europe.

[30]  Jacob Millman,et al.  Electronic Devices and Circuits , 1968 .

[31]  Dejan Nickovic,et al.  AMT: A Property-Based Monitoring Tool for Analog Systems , 2007, FORMATS.

[32]  Insup Lee,et al.  Model-based testing and monitoring for hybrid embedded systems , 2004, Proceedings of the 2004 IEEE International Conference on Information Reuse and Integration, 2004. IRI 2004..