From Sequential Extended Regular Expressions to Determinstic Finite Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

From Sequential Extended Regular Expressions to Determinstic Finite Automata

Résumé

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 theorical results has been developed: it takes as input a PSL SERE assertion and returns a VHDL description of a monitor checking this fornula.
Fichier non déposé

Dates et versions

hal-00078811 , version 1 (07-06-2006)

Identifiants

  • HAL Id : hal-00078811 , version 1

Citer

E. Gascard. From Sequential Extended Regular Expressions to Determinstic Finite Automata. Information and Communications Technology, 2005. Enabling Technologies for the New Knowledge Society: ITI 3rd International Conference on, 2005, Cairo, Egypt. pp.145- 157. ⟨hal-00078811⟩
47 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More