Skip to main content

Combining Time and Frequency Domain Specifications for Periodic Signals

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7186))

Abstract

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.

This work was supported, in part, by the US National Science Foundation (NSF) awards CNS-1017074 and CNS-1016994.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alur, R., Kurshan, R.P., Viswanathan, M.: Membership questions for timed and hybrid automata. In: RTSS 1998, pp. 254–264. IEEE (1998)

    Google Scholar 

  3. Åstrom, K., Murray, R.M.: Feedback Systems: An Introduction for Engineers and Scientists. Princeton University Press (2005)

    Google Scholar 

  4. Boyd, S., Vandenberghe, S.: Convex Optimization. Cambridge University Press (2004), http://www.stanford.edu/~boyd/cvxbook.html

  5. de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Fainekos, G.E., Pappas, G.J.: Robustness of temporal logic specifications for continuous-time signals. Theoretical Computer Science 410(42), 4262–4291 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Form. Methods Syst. Des. 24, 101–127 (2004)

    Article  MATH  Google Scholar 

  8. Frehse, G., Krogh, B.H., Rutenbar, R.A., Maler, O.: Time domain verification of oscillator circuit properties. Electron. Notes Theor. Comput. Sci. 153, 9–22 (2006)

    Article  Google Scholar 

  9. Geilen, M.: On the construction of monitors for temporal logic properties. In: Proceedings of the 1st Workshop on Runtime Verification. ENTCS, vol. 55, pp. 181–199 (2001)

    Google Scholar 

  10. Havelund, K., Rosu, G.: Monitoring programs using rewriting. In: Proceedings of the 16th IEEE International Conference on Automated Software Engineering (2001)

    Google Scholar 

  11. Hedrich, L., Barke, E.: A formal approach to verification of linear analog circuits with parameter tolerances. In: Proceedings of the Conference on Design, Automation and Test in Europe (DATE), pp. 649–655. IEEE Computer Society, Washington, DC (1998)

    Google Scholar 

  12. Henzinger, T.A.: The theory of hybrid automata. In: LICS 1996, pp. 278–292. IEEE (1996)

    Google Scholar 

  13. Kristoffersen, K.J., Pedersen, C., Andersen, H.R.: Runtime verification of timed LTL using disjunctive normalized equation systems. In: Proceedings of the 3rd Workshop on Run-time Verification. ENTCS, vol. 89, pp. 1–16 (2003)

    Google Scholar 

  14. Lovasz, L.: Hit-and-run is fast and run. Mathematical Programming 86, 443–461 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Maler, O., Nickovic, D.: Monitoring Temporal Properties of Continuous Signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 152–166. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Millman, J., Halkias, C.C.: Electronic Devices and Circuits. McGraw-Hill Inc. (1967)

    Google Scholar 

  17. Monniaux, D.: On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 570–583. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Nghiem, T., Sankaranarayanan, S., Fainekos, G.E., Ivancic, F., Gupta, A., Pappas, G.J.: Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems. In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, pp. 211–220 (2010)

    Google Scholar 

  19. Nickovic, D., Maler, O.: AMT: A Property-Based Monitoring Tool for Analog Systems. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 304–319. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Oppenheim, A.V., Schafer, R.W.: Digital Signal Processing. Prentice Hall (1975)

    Google Scholar 

  21. Rubinstein, R.Y., Kroese, D.P.: Simulation and the Monte Carlo Method. Wiley Series in Probability and Mathematical Statistics (2008)

    Google Scholar 

  22. Smith, R.L.: The hit-and-run sampler: a globally reaching markov chain sampler for generating arbitrary multivariate distributions. In: Proceedings of the 28th Conference on Winter Simulation, pp. 260–264. IEEE Computer Society (1996)

    Google Scholar 

  23. Steinhorst, S., Hedrich, L.: Model checking of analog systems using an analog specification language. In: Proceedings of the Conference on Design, Automation and Test in Europe, DATE 2008, pp. 324–329. ACM, New York (2008)

    Chapter  Google Scholar 

  24. Tan, L., Kim, J., Lee, I.: Testing and monitoring model-based generated program. In: Proceedings of the 3rd Workshop on Run-time Verification. ENTCS, vol. 89, pp. 1–21 (2003)

    Google Scholar 

  25. Tan, L., Kim, J., Sokolsky, O., Lee, I.: Model-based testing and monitoring for hybrid embedded systems. In: Proceedings of the 2004 IEEE International Conference on Information Reuse and Integration, pp. 487–492 (2004)

    Google Scholar 

  26. Thati, P., Rosu, G.: Monitoring algorithms for metric temporal logic specifications. In: Runtime Verification. ENTCS, vol. 113, pp. 145–162. Elsevier (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chakarov, A., Sankaranarayanan, S., Fainekos, G. (2012). Combining Time and Frequency Domain Specifications for Periodic Signals. In: Khurshid, S., Sen, K. (eds) Runtime Verification. RV 2011. Lecture Notes in Computer Science, vol 7186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29860-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29860-8_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29859-2

  • Online ISBN: 978-3-642-29860-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics