Efficient model checking of safety properties

  • Authors:
  • Timo Latvala

  • Affiliations:
  • Laboratory for Theoretical Computer Science, Helsinki University of Technology, Finland

  • Venue:
  • SPIN'03 Proceedings of the 10th international conference on Model checking software
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problems of identifying LTL safety properties and translating them to finite automata. We present an algorithm for constructing finite automata recognising informative prefixes of LTL formulas based on [1]. The implementation also includes a procedure for deciding if a formula is pathologic. Experimental results indicate that the translation is competitive when compared to model checking with tools translating full LTL to Büchi automata.