论文信息 - Automata Construction for Regular Expressions in Model Checking

Automata Construction for Regular Expressions in Model Checking

Industrial temporal languages like PSL/Sugar and ForSpec have augmented the language with Regular Expressions ( REs). An RE specification represents a sequence of Boolean events a model may or may not exhibit. A common way of usingREs for specification is in a negative way: a not RE! property describes an undesirable behavior of the model. A not r! formula has the nature that it is sufficient to find one execution path of the model satisfying r in order to conclude the formula does not hold in the model. This nature allows a not r! formula to be modeled by a non-deterministic finite automaton ( NFA) Nr, which accepts sequences satisfying r, and which is linear in the size of r. In this paper we discuss the translation of a not RE! into an NFA. While many translation methods exist in the literature ([12, 11]), to the best of our knowledge, the adoption of such a method to model-checking has never been explicitly discussed before. We present our method, which adopts that of Glushkov [11] to better suit model checking needs, and discuss its advantages.

[1] Ilan Beer,et al. On-the-Fly Model Checking of RCTL Formulas , 1998, CAV.

[2] Ilan Beer,et al. RuleBase: Model Checking at IBM , 1997, CAV.

[3] Amir Pnueli,et al. Algorithmic Verification of Linear Temporal Logic Specifications , 1998, ICALP.

[4] Monika Maidl,et al. The Common Fragment of CTL and LTL , 2000, FOCS.

[5] Ilan Beer,et al. An Optimized Symbolic Bounded Model Checking Engine , 2003, CHARME.

[6] Armando Tacchella,et al. Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.

[7] Shoham Ben-David,et al. Model Checking at IBM , 2003, Formal Methods Syst. Des..

[8] Moshe Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[9] Sharon Barner,et al. Searching for Counter-Examples Adaptively , 2003, IWFM.

[10] Avner Landver,et al. The ForSpec Temporal Logic: A New Temporal Property-Specification Language , 2002, TACAS.

[11] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.

[12] V. Glushkov. THE ABSTRACT THEORY OF AUTOMATA , 1961 .

[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[14] Kavita Ravi,et al. Efficient Decision Procedures for Model Checking of Linear Time Logic Properties , 1999, CAV.