From Sequential Extended Regular Expressions to Determinstic Finite Automata

This paper explains how to construct automatically monitors for dynamic verification of PSL sequential extended regular expressions assertions. The construction method is based on our extension of Brzozowski's derivatives in the context of PSL SERE. Brzozowski's derivatives are an elegant and natural way for solving the problem of converting a Kleene's regular expression to a deterministic automaton. A software implementing these theoretical results has been developed: it takes as input a PSL SERE assertion and returns a VHDL description of a monitor checking this formula