Simulation of Simultaneous Events in Regular Expressions for Run-Time Verification

  • Authors:

  • Usa Sammapun;Arvind Easwaran;Insup Lee;Oleg Sokolsky

  • Affiliations:

  • Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA;Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA;Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA;Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

When specifying system requirements, we want a language that can express the requirements in the simplest and most intuitive form. Although the MaC system provides an expressive language, called MEDL, it is generally awkward to express certain features like temporal ordering of complex events, timing constraints, and frequencies of events which are inherent in safety properties. MEDL-RE extends the MEDL language to include regular expressions to easily specify timing dependencies and timing constraints. Due to simultaneous events generated by the MaC system, monitoring regular expressions by simulating DFAs would result in a potential problem. The DFA simulations would involve concurrent multi-path simulations and result in exponential running time. To handle simultaneous events inexpensively, we generate a dependency graph to identify possible simultaneous events. Further, we augment the original DFAs with alternative transitions, which will substitute for multi-path simulations.