Runtime monitoring and verification of systems with hidden information

  • Doron Drusinsky
Original Paper


This paper describes a technique for runtime monitoring (RM) and runtime verification (RV) of systems with invisible events and data artifacts. Our approach combines well-known hidden markov model (HMM) techniques for learning and subsequent identification of hidden artifacts, with runtime monitoring of probabilistic formal specifications. The proposed approach entails a process in which the end-user first develops and validates deterministic formal specification assertions, s/he then identifies hidden artifacts in those assertions. Those artifacts induce the state set of the identifying HMM. HMM parameters are learned using standard frequency analysis techniques. In the verification or monitoring phase, the system emits visible events and data symbols, used by the HMM to deduce invisible events and data symbols, and sequences thereof; both types of symbols are then used by a probabilistic formal specification assertion to monitor or verify the system.


Hidden markov models Formal specification Validation Verification Monitoring Assertions 


  1. 1.
    Davies KH, Biddulph R, Balashek S (1952) Automatic speech recognition of spoken digits. J Acoust Soc Am 24(6):637–642CrossRefGoogle Scholar
  2. 2.
    Drusinsky D (2006) Modeling and verification using UML statecharts—a working guide to reactive system design. Runtime monitoring and execution-based model checking. Elsevier, AmsterdamGoogle Scholar
  3. 3.
    Drusinsky D (2011) Practical UML-based specification, validation, and verification of mission-critical software. DogEar Publishing, MichiganGoogle Scholar
  4. 4.
    Drusinsky D (2000) The temporal rover and the ATG rover. In: Proceedings of SPIN 2000 workshop. LNCS, vol 1885. Springer, Berlin, pp 323–329Google Scholar
  5. 5.
    Drusinsky D (2012) Behavioral and temporal pattern detection within financial data with hidden information. J Univers Comput Sci 18(14):1950–1966Google Scholar
  6. 6.
    Drusinsky D, Michael JB, Shing M (Dec. 2008) A visual tradeoff space for formal verification and validation techniques. IEEE Syst J 2(4):513–519Google Scholar
  7. 7.
    Drusinsky D, Michael B, Otani T, Shing M (2008) Validating UML statechart-based assertions libraries for improved reliability and assurance. In: Proceedings of the second international conference on secure system integration and reliability improvement (SSIRI 2008), Yokohama, Japan, 14–17 July 2008, pp 47–51. Best paper awardGoogle Scholar
  8. 8.
    Drusinsky D, Shing M (2003) Verification of timing properties in rapid system prototyping. In: Proceedings of 14th IEEE international workshop in rapid systems prototyping, 9–11 June 2003, pp 47–53Google Scholar
  9. 9.
    Demir K, Drusinsky D, Shing M (2006) Creation and validation of embedded assertions statecharts. In: 17th IEEE international workshop on rapid systems prototyping, Chania, Greece, June, pp 17–23Google Scholar
  10. 10.
    Harel D (1987) Statecharts: a visual formalism for complex systems. Sci Comput Program 8(3):231–274CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Havelund K, Pressburger T (2000) Model checking Java programs using Java PathFinder. Int J Softw Tools Technol Transf 2(4):366–381Google Scholar
  12. 12.
    Havelund K, Rosu G (2004) An overview of the runtime verification tool Java PathExplorer. In: Formal Methods in System Design, vol 24. Springer, The Netherlands, pp 189–215Google Scholar
  13. 13.
    Hopcroft JE Ullman JD (2006) Introduction to automata theory, languages, and computation. Addison Wesley, BostonGoogle Scholar
  14. 14.
  15. 15.
    Kohavi Z, Jha NK (2009) Switching and finite automata theory. Cambridge University Press, CambridgeGoogle Scholar
  16. 16.
    Mann TP (2006) Numerically stable hidden markov model implementation. An HMM scaling tutorialGoogle Scholar
  17. 17.
    Newberg L (2009) Error statistics of hidden Markov model and hidden Boltzmann model results. BMC Bioinform 10:212. doi: 10.1186/1471-2105-10-212 CrossRefGoogle Scholar
  18. 18.
    Pierce J (1969) Whither speech recognition. J Acoust Soc AmGoogle Scholar
  19. 19.
    Rabiner LW (1989) A tutorial on hidden markov models and selected applications in speach recognition. Proc IEEE 77(2):257–286Google Scholar
  20. 20.
    Rätsch, G, Sonnenburg S, Srinivasan J, Witte H, Müller KR, Sommer RJ, Schölkopf B (2007) Improving the C. elegans genome annotation using machine learning. PLoS Comput Biol 3(2):e20. doi: 10.1371/journal.pcbi.0030020
  21. 21.
    Sammapun U, Lee I, Sokolsky O (2005) RT-MaC: Runtime monitoring and checking of quantitative and probabilistic properties. In: Proceedings 11th IEEE international conference on embedded and real-time computing systems and applications. IEEE, New York, pp 147–153Google Scholar
  22. 22.
    Singh S (1999) The code book: the science of secrecy from ancient Egypt to quantum cryptography. Fourth Estate, London, pp 143–189, ISBN: 1-85702-879-1Google Scholar
  23. 23.
    The StateRover.

Copyright information

© Springer-Verlag (outside the USA) 2013

Authors and Affiliations

  1. 1.Department of Computer ScienceNaval Postgraduate SchoolMontereyUSA
  2. 2.Time Rover, Inc.CupertinoUSA

Personalised recommendations